On R-trees with low query complexity

DOI10.1016/S0925-7721(02)00112-8zbMATH Open1012.68208MaRDI QIDQ1869749FDOQ1869749

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

Publication date: 28 April 2003

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

Recommendations

• scientific article; zbMATH DE number 1670656
• Box-trees and R-trees with near-optimal query time
• Box-trees and R-trees with near-optimal query time
• Cache-oblivious R-trees
• The priority R-tree: a practically efficient and worst-case optimal R-tree

zbMATH Keywords

computational geometrydata structureR-treespatial access methodbounding-volume hiearchy

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Analysis of a bounding box heuristic for object intersection
• Title not available (Why is that?)
• Enclosing many boxes by an optimal pair of boxes
• Title not available (Why is that?)

Cited In (15)

• Algorithms and Data Structures
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cache-oblivious R-trees
• Box-trees and R-trees with near-optimal query time
• Efficient \(c\)-oriented range searching with DOP-trees
• Efficient bulk operations on dynamic \(R\)-trees
• Title not available (Why is that?)
• Cache-oblivious R-trees
• Algorithms for improving the quality of \(R\)-trees
• A GIS data index method based on R-trees
• On Cartesian Trees and Range Minimum Queries
• R-trees: theory and applications
• Box-trees and R-trees with near-optimal query time
• Title not available (Why is that?)

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

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