Sciweavers

Share
SMA
2003
ACM

Fast swept volume approximation of complex polyhedral models

9 years 11 months ago
Fast swept volume approximation of complex polyhedral models
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a path specified as a parametric curve, our algorithm enumerates a superset of the boundary surfaces of SV. It consists of ruled and developable surface primitives, and the SV corresponds to the outer boundary of their arrangement. We approximate this boundary by using a five-stage pipeline. This includes computing a bounded-error approximation of each surface primitive, computing unsigned distance fields on a uniform grid, classifying all grid points using fast marching front propagation, iso-surface reconstruction, and topological refinement. We also present a novel and fast algorithm for computing the signed distance of surface primitives as well as a number of techniques based on surface culling, fast marching level-set methods and rasterization hardware to improve the performance of the overall algorithm....
Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh
Added 05 Jul 2010
Updated 05 Jul 2010
Type Conference
Year 2003
Where SMA
Authors Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh Manocha
Comments (0)
books