Closest-pair queries and minimum-weight queries are equivalent for squares

DOI10.1016/J.COMGEO.2021.101810OpenAlexW3164200682MaRDI QIDQ824331FDOQ824331

Abrar Kazi, Michiel Smid

Publication date: 15 December 2021

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

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

zbMATH Keywords

data structuresrange searchingclosest pairsminimum-weight queries

Mathematics Subject Classification ID

Theory of data (68Pxx) Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Computing methodologies and applications (68Uxx)

Cites Work

• Computational geometry. Algorithms and applications.
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• Optimal Search in Planar Subdivisions
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Data structures for range-aggregate extent queries
• Algorithms and Computation
• On the power of the semi-separated pair decomposition
• Closest-pair queries in fat rectangles
• New Bounds for Range Closest-Pair Problems
• Range closest-pair search in higher dimensions

This page was built for publication: Closest-pair queries and minimum-weight queries are equivalent for squares

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