论文信息 - Box-trees for collision checking in industrial installations

Box-trees for collision checking in industrial installations

A box-tree is a bounding-volume hierarchy that uses axis-aligned boxes as bounding volumes. We describe a new algorithm to construct a box-tree for a 3D scene consisting of n objects, and we analyze its worst-case query time for approximate range queries. If the input scene has certain characteristics that we derived from our application---collision detection in industrial installations---then the query times are polylogarithmic, not only for searching with boxes but also for range searching with other constant-complexity ranges.

[1] Mark de Berg,et al. Realistic input models for geometric algorithms , 1997, SCG '97.

[2] Michael T. Goodrich,et al. Balanced aspect ratio trees: combining the advantages of k-d trees and octrees , 1999, SODA '99.

[3] Mark de Berg,et al. Motion Planning in Environments with Low Obstacle Density , 1998, Discret. Comput. Geom..

[4] A. Frank van der Stappen,et al. Motion planning amidst fat obstacles , 1993 .

[5] Sunil Arya,et al. Approximate range searching , 1995, SCG '95.

[6] Nancy M. Amato,et al. A randomized roadmap method for path and manipulation planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[7] Lydia E. Kavraki,et al. Random networks in configuration space for fast path planning , 1994 .

[8] Joachim Gudmundsson,et al. Box-Trees and R-Trees with Near-Optimal Query Time , 2001, SCG '01.

[9] Michael T. Goodrich,et al. K-D Trees Are Better when Cut on the Longest Side , 2000, ESA.