Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees

DOI10.1006/JAGM.2000.1135zbMATH Open0969.68115OpenAlexW2151942047MaRDI QIDQ2709802FDOQ2709802

Authors: Christian A. Duncan, Stephen G. Kobourov, Michael T. Goodrich 

Publication date: 7 October 2001

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2000.1135

Recommendations

• scientific article; zbMATH DE number 1305419
• Algorithms and Data Structures
• Multidimensional balanced binary trees
• Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees
• Quad-\(K\)-d trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited In (15)

• Algorithms and Data Structures
• New constructions of SSPDs and their applications
• Geometric spanners for weighted point sets
• Approximate polytope membership queries
• On the power of the semi-separated pair decomposition
• Point set distance and orthogonal range problems with dependent geometric uncertainties
• Approximate Range Searching in External Memory
• Region-fault tolerant geometric spanners
• SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
• Approximate range searching in external memory
• Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees
• Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs
• Efficient implementation of complex equations of state in a high-order framework
• On the Power of the Semi-Separated Pair Decomposition
• Approximate range searching

This page was built for publication: Balanced aspect ratio trees: Combining the advantages of \(k\)-\(d\) trees and octrees

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