Closest-pair queries in fat rectangles

DOI10.1016/j.comgeo.2019.05.003OpenAlexW2892927166MaRDI QIDQ2331215

Sang Won Bae, Michiel H. M. Smid

Publication date: 25 October 2019

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

Full work available at URL: https://arxiv.org/abs/1809.10531

zbMATH Keywords

data structuresrange searchingYao graphclosest pairsfat rectangles

Mathematics Subject Classification ID

Numerical approximation and computational geometry (primarily algorithms) (65Dxx)

Related Items (4)

Closest-pair queries and minimum-weight queries are equivalent for squares ⋮ Approximate range closest-pair queries ⋮ Range closest-pair search in higher dimensions ⋮ Searching for the closest-pair in a query translate

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data structures for range-aggregate extent queries
• An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs
• On the power of the semi-separated pair decomposition
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• New Bounds for Range Closest-Pair Problems
• Algorithms and Computation

This page was built for publication: Closest-pair queries in fat rectangles