On R-trees with low query complexity

DOI10.1016/S0925-7721(02)00112-8zbMath1012.68208MaRDI QIDQ1869749

Mark H. Overmars, Joachim Gudmundsson, Mikael Hammar, Mark T. de Berg

Publication date: 28 April 2003

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

zbMATH Keywords

computational geometryR-treedata structurespatial access methodbounding-volume hiearchy

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

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

Cites Work

• Analysis of a bounding box heuristic for object intersection
• Enclosing many boxes by an optimal pair of boxes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On R-trees with low query complexity