Robotics: Science and Systems V
Inner sphere trees for proximity and penetration queries
R. Weller and G. ZachmannAbstract:
We present a novel geometric data structure for approximate collision detection at haptic rates between rigid objects. Our data structure, which we call inner sphere trees, supports different kinds of queries, namely, proximity queries and a new method for interpenetration computation, the penetration volume, which is related to the water displacement of the overlapping region and, thus, corresponds to a physically motivated force. The main idea is to bound objects from the inside with a set of non-overlapping spheres. Based on such sphere packings, a âinner bounding volume hierarchyâ can be constructed. In order to do so, we propose to use an AI clustering algorithm, which we extend and adapt here. The results show performance at haptic rates both for proximity and penetration volume queries for models consisting of hundreds of thousands of polygons.
Bibtex:
@INPROCEEDINGS{ Weller-RSS-09, AUTHOR = {R. Weller AND G. Zachmann}, TITLE = {Inner sphere trees for proximity and penetration queries}, BOOKTITLE = {Proceedings of Robotics: Science and Systems}, YEAR = {2009}, ADDRESS = {Seattle, USA}, MONTH = {June}, DOI = {10.15607/RSS.2009.V.010} }