Sciweavers

Share
SI3D
2006
ACM

Interactive 3D distance field computation using linear factorization

10 years 1 months ago
Interactive 3D distance field computation using linear factorization
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance field for each slice of a uniform spatial grid. We express the non-linear distance function of each primitive as a dot product of linear factors. The linear terms are efficiently computed using texture mapping hardware. We also improve the performance by using culling techniques that reduce the number of distance function evaluations using bounds on Voronoi regions of the primitives. Our algorithm involves no preprocessing and is able to handle complex deforming models at interactive rates. We have implemented our algorithm on a PC with NVIDIA GeForce 7800 GPU and applied it to models composed of thousands of triangles. We demonstrate its application to medial axis approximation and proximity computations between rigid and deformable models. In practice, our algorithm is more accurate and almost one order o...
Avneesh Sud, Naga K. Govindaraju, Russell Gayle, D
Added 14 Jun 2010
Updated 14 Jun 2010
Type Conference
Year 2006
Where SI3D
Authors Avneesh Sud, Naga K. Govindaraju, Russell Gayle, Dinesh Manocha
Comments (0)
books