Algorithms and Data Structures

DOI10.1007/11534273zbMATH Open1161.68397OpenAlexW3010016474MaRDI QIDQ5394239FDOQ5394239

Authors: Amitabh Chaudhary, Michael T. Goodrich 

Publication date: 25 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11534273

Recommendations

• Balanced aspect ratio trees: Combining the advantages of \(k\)-\(d\) trees and octrees
• scientific article; zbMATH DE number 1305419
• Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs
• scientific article; zbMATH DE number 1670656
• On R-trees with low query complexity

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15)

Cited In (1)

• Balanced aspect ratio trees: Combining the advantages of \(k\)-\(d\) trees and octrees

This page was built for publication: Algorithms and Data Structures

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