Efficient \(c\)-oriented range searching with DOP-trees

DOI10.1016/j.comgeo.2008.05.002zbMath1200.68260OpenAlexW1981363048MaRDI QIDQ1000927

Micha Streppel, Mark T. de Berg, Herman J. Haverkort

Publication date: 12 February 2009

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.05.002

zbMATH Keywords

range searchinggeometric data structuresbounding-volume hierarchies

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Cites Work

• Efficient partition trees
• Approximate range searching
• Box-trees and R-trees with near-optimal query time
• On R-trees with low query complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item