AfriGraph '01 1st International Conference on Virtual Reality, Computer Graphics and Visualization in Southern Africa ( formerly known as SAGA 2001 )
Fast proximity computation among deformable models using discrete Voronoi diagrams
ACM SIGGRAPH 2006 Papers
Visualization in Medicine: Theory, Algorithms, and Applications
Visualization in Medicine: Theory, Algorithms, and Applications
Computing the distance between canal surfaces
GMP'10 Proceedings of the 6th international conference on Advances in Geometric Modeling and Processing
Distance computation for canal surfaces using cone-sphere bounding volumes
Computer Aided Geometric Design
| Hi-index | 0.02 |
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between two polyhedra, it is important to search efficiently the pair of the triangles, which gives the pair of closest points.In our algorithm discrete Voronoi regions are prepared as voxels around a non-convex polyhedron. Each voxel is given the list of triangles, which have possibility to be the closest to the points in the voxel. When a triangle on the other object is intersecting a voxel, the closest triangles can be efficiently searched from this list on the voxel.The algorithm has been implemented, and the results of distance computations show that it can calculate the minimum distance between non-convex polyhedra composed of a thousand of triangles at interactive rates.