Fast, parallel, GPU-based construction of space filling curves and octrees
Indian Institute of Technology, Bombay
In Proceedings of the 2008 symposium on Interactive 3D graphics and games (2008)
@inproceedings{ajmera2008fast,
title={Fast, parallel, GPU-based construction of space filling curves and octrees},
author={Ajmera, P. and Goradia, R. and Chandran, S. and Aluru, S.},
booktitle={Proceedings of the 2008 symposium on Interactive 3D graphics and games},
pages={10},
year={2008},
organization={ACM}
}
Space Filling Curves (SFC) are particularly useful in linearization of data living in two and three dimensional spaces and have been used in a number of applications in scientific computing, and visualization. Interestingly, octrees, another versatile data structure in computer graphics, can be viewed as multiple SFCs at varying resolutions, albeit with parent-child relationship. In this paper we provide a parallel implementation of SFCs and octrees on GPUs that rely on algorithms designed to minimize or eliminate communications.
June 21, 2011 by hgpu
