Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees
From MaRDI portal
Publication:2709802
DOI10.1006/jagm.2000.1135zbMath0969.68115OpenAlexW2151942047MaRDI QIDQ2709802
Stephen G. Kobourov, Christian A. Duncan, 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
Related Items
POINT SET DISTANCE AND ORTHOGONAL RANGE PROBLEMS WITH DEPENDENT GEOMETRIC UNCERTAINTIES ⋮ On the Power of the Semi-Separated Pair Decomposition ⋮ Approximate range searching in external memory ⋮ New constructions of SSPDs and their applications ⋮ Approximate Polytope Membership Queries ⋮ Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees ⋮ Geometric spanners for weighted point sets ⋮ On the power of the semi-separated pair decomposition ⋮ SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS ⋮ Approximate Range Searching in External Memory ⋮ Region-fault tolerant geometric spanners ⋮ Approximate range searching
