Box-trees for collision checking in industrial installations

Authors:
Herman J. Haverkort;Mark de Berg;Joachim Gudmundsson
Affiliations:
Institute of Information and Computing Sciences, Utrecht University, PO Box 80.089, 3508 TB Utrecht, The Netherlands;Faculty of Mathematics and Computing Science, TU Eindhoven, PO Box 513, 5600 MB Eindhoven, The Netherlands;Faculty of Mathematics and Computing Science, TU Eindhoven, PO Box 513, 5600 MB Eindhoven, The Netherlands
Venue:
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
Year:
2004

Citing 4
Cited 4

Random networks in configuration space for fast path planning

Random networks in configuration space for fast path planning
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximate range searching

Computational Geometry: Theory and Applications
Balanced aspect ratio trees

Balanced aspect ratio trees

Constructing minimum-interference networks

Computational Geometry: Theory and Applications
Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions

Computational Geometry: Theory and Applications
Point distance and orthogonal range problems with dependent geometric uncertainties

Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
Constructing interference-minimal networks

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 objects in a 3D scene, 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.