Data structures for range-aggregate extent queries

DOI10.1016/j.comgeo.2009.08.001zbMath1302.65054OpenAlexW2124120807MaRDI QIDQ390147

Yokesh Kumar, Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid

Publication date: 22 January 2014

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

Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.08.001

zbMATH Keywords

widthdiameterdata structurescomputational geometryVoronoi diagramsrange searchingclosest pairEuclidean minimum spanning treesmultilevel range trees

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Closest-pair queries and minimum-weight queries are equivalent for squares, On the Power of the Semi-Separated Pair Decomposition, New bounds for range closest-pair problems, On the power of the semi-separated pair decomposition, Approximate range closest-pair queries, Data structures for extension violations in a query range, Range closest-pair search in higher dimensions, Searching for the closest-pair in a query translate, Finding pairwise intersections inside a query range, Closest-pair queries in fat rectangles, New Bounds for Range Closest-Pair Problems, Approximate Range Queries for Clustering