Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back

DOI10.4230/LIPICS.SOCG.2017.27zbMath1433.68484OpenAlexW2724706363MaRDI QIDQ4580101

Timothy M. Chan

Publication date: 13 August 2018

Full work available at URL: https://doi.org/10.4230/LIPIcs.SoCG.2017.27

zbMATH Keywords

data structurescomputational geometryrange searchingnearest neighbor searching

Mathematics Subject Classification ID

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

Related Items (1)

Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions

This page was built for publication: Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back