Accelerated proximity queries between convex polyhedra by multi-level Voronoi marching
- 8 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 2101-2106
- https://doi.org/10.1109/iros.2000.895281
Abstract
We present an accelerated proximity query algorithm between moving convex polyhedra. The algorithm combines Voronoi-based feature tracking with a multi-level-of-detail representation, in order to adapt to the variation in levels of coherence and speed up the computation. It provides a progressive refinement framework for collision detection and distance queries. We have implemented our algorithm and have observed significant performance improvements in our experiments, especially on scenarios where the coherence is low.Keywords
This publication has 17 references indexed in Scilit:
- Determining the separation of preprocessed polyhedra — A unified approachPublished by Springer Nature ,2005
- A fast algorithm for incremental distance calculationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- H-WalkPublished by Association for Computing Machinery (ACM) ,1999
- V-ClipACM Transactions on Graphics, 1998
- Efficient collision detection using bounding volume hierarchies of k-DOPsIEEE Transactions on Visualization and Computer Graphics, 1998
- View-dependent simplification of arbitrary polygonal environmentsPublished by Association for Computing Machinery (ACM) ,1997
- OBBTreePublished by Association for Computing Machinery (ACM) ,1996
- Interactive collision detectionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- A fast procedure for computing the distance between complex objects in three-dimensional spaceIEEE Journal on Robotics and Automation, 1988
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983