Box-trees for collision checking in industrial installations

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2002, Pages 53-62

  Haverkort, Herman J ^a   De Berg, Mark ^a   Gudmundsson, Joachim ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Bounding volume hierarchy; Box tree; Orthogonal range query; Slicing number; Window query

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; HIERARCHICAL SYSTEMS;

BOUNDING-VOLUME HIERARCHY;

COMPUTATIONAL GEOMETRY;

EID: 0036355688     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/513400.513407     Document Type: Conference Paper

References (11)

1. Box-trees and R-trees with near-optimal query time
2. A randomized roadmap method for path and manipulation planning
3. Approximate range searching
4. Realistic input models for geometric algorithms
5. K-D trees are better when cut on the longest side
6. Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees
7. MOLOG: Motion for logistics
8. Motion planning in environments with low obstacle density