5093

Swept Volume approximation of polygon soups

Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Laumond
LAAS-CRNS, Toulouse
IEEE International Conference on Robotics and Automation, 2007

@article{himmelstein2010swept,

   title={Swept volume approximation of polygon soups},

   author={Himmelstein, J.C. and Ferr{‘e}, E. and Laumond, J.P.},

   journal={Automation Science and Engineering, IEEE Transactions on},

   volume={7},

   number={1},

   pages={177–183},

   year={2010},

   publisher={IEEE}

}

Download Download (PDF)   View View   Source Source   

844

views

We present a fast GPU-based algorithm to approximate the swept volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume swept by an object along a trajectory, the efficient algorithms described have imposed constraints on both the trajectories and geometric models. By proposing a general algorithm that handles flat surfaces as well as volumes and disconnected objects, we allow SV calculation without resorting to pre-processing mesh repair. This is of particular interest in the domain of product lifecycle management (PLM), which deals with industrial computer aided design (CAD) models that are malformed more often than not. We incorporate the bounded distance operator used in path planning to efficiently sample the trajectory while controlling the total error. We develop a triangulation scheme that draws on the unique data set created by an advancing front level-set method to tessellate the SV boundary in linear time. We analyze its performance, and demonstrate its effectiveness both theoretically and on real cases taken from PLM.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: