Box-trees for collision checking in industrial installations

DOI10.1145/513400.513407zbMath1414.68125OpenAlexW2209092901MaRDI QIDQ4557537

Joachim Gudmundsson, Herman J. Haverkort, Mark T. 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

window queryorthogonal range queryslicing numberbox-treebounding-volume hierarchy

Mathematics Subject Classification ID

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

Related Items (4)

Approximate range searching in external memory ⋮ Approximate Range Searching in External Memory ⋮ Approximate range searching using binary space partitions ⋮ Local polyhedra and geometric graphs

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