Issue No. 05 - May (2014 vol. 20)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2013.268
Fuchang Liu , Department of Computer Engineering , Ewha Womans University, Daehyeon-dong 11-1 Seodaemun-gu, South Korea
Young J. Kim , Department of Computer Engineering , Ewha Womans University, Daehyeon-dong 11-1 Seodaemun-gu, South Korea
Most techniques for real-time construction of a signed distance field, whether on a CPU or GPU, involve approximate distances. We use a GPU to build an exact adaptive distance field, constructed from an octree by using the Morton code. We use rectangle-swept spheres to construct a bounding volume hierarchy (BVH) around a triangulated model. To speed up BVH construction, we can use a multi-BVH structure to improve the workload balance between GPU processors. An upper bound on distance to the model provided by the octree itself allows us to reduce the number of BVHs involved in determining the distances from the centers of octree nodes at successively lower levels, prior to an exact distance query involving the remaining BVHs. Distance fields can be constructed 35-64 times as fast as a serial CPU implementation of a similar algorithm, allowing us to simulate a piece of fabric interacting with the Stanford Bunny at 20 frames per second.
Octrees, Graphics processing units, Computational modeling, Adaptation models, Instruction sets, Parallel processing, Vectors
F. Liu and Y. J. Kim, "Exact and Adaptive Signed Distance FieldsComputation for Rigid and DeformableModels on GPUs," in IEEE Transactions on Visualization & Computer Graphics, vol. 20, no. 5, pp. 714-725, 2014.