Box-trees for collision checking in industrial installations

DOI10.1145/513400.513407MaRDI QIDQ4557537zbMATH OpenOpenAlexFDO

Authors Joachim Gudmundsson, Herman Haverkort, Mark de Berg

Publication date 23 November 2018

Published in Proceedings of the eighteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://dspace.library.uu.nl/handle/1874/23954

zbMATH Keywords

bounding-volume hierarchybox-treeorthogonal range queryslicing numberwindow query

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Recommendations

• Box-trees and R-trees with near-optimal query time
• Box-trees and R-trees with near-optimal query time
• scientific article; zbMATH DE number 1303549
• Box sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching
• scientific article; zbMATH DE number 1280933

Cited in

(8)

• Local polyhedra and geometric graphs
• Approximate range searching using binary space partitions
• scientific article; zbMATH DE number 1670680 (Why is no real title available?)
• Efficient Collision Detection of Complex Deformable Models using AABB Trees
• scientific article; zbMATH DE number 1305478 (Why is no real title available?)
• Approximate Range Searching in External Memory
• Approximate range searching in external memory
• The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing

This page was built for publication: Box-trees for collision checking in industrial installations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4557537)