ICRA 2012 Paper Abstract


Paper TuB08.3

von Dziegielewski, Andreas (Johannes Gutenberg-Universität Mainz), Hemmer, Michael (Tel Aviv University), Schömer, Elmar (Mainz University)

High Quality Conservative Surface Mesh Generation for Swept Volumes

Scheduled for presentation during the Regular Session "3D Surface Models, Point Cloud Processing" (TuB08), Tuesday, May 15, 2012, 11:00−11:15, Meeting Room 8 (Wacipi)

2012 IEEE International Conference on Robotics and Automation, May 14-18, 2012, RiverCentre, Saint Paul, Minnesota, USA

This information is tentative and subject to change. Compiled on August 20, 2018

Keywords Motion and Path Planning, Collision Avoidance


We present a novel and efficient and flexible scheme to generate a high quality mesh that approximates the outer boundary of a swept volume. Our approach comes with two guarantees. First, the approximation is conservative, i.e., the swept volume is enclosed by the generated mesh. Second, the one-sided Hausdorff distance of the generated mesh to the swept volume is upper bounded by a user defined tolerance. Exploiting this tolerance the algorithm generates a mesh that is adapted to the local complexity of the swept volume boundary, keeping the overall output complexity remarkably low. The algorithm is two-phased: the actual sweep and the mesh generation. In the sweeping phase we introduce a general framework to compute a compressed voxelization. The phase is tailored for an easy application of parallelization techniques. We show this for our exemplary implementation and provide a multi-core solution as well as a GPU based solution using CUDA. The meshing phase utilizes Delaunay refinement which we carefully modified such that required guarantees are met. The approach is able to handle inputs of very high complexity at desired precision, which we demonstrate on real industrial data sets.



Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2018 PaperCept, Inc.
Page generated 2018-08-20  08:14:47 PST  Terms of use