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

DOI10.1016/J.COMGEO.2021.101810MaRDI QIDQ824331zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• New bounds for range closest-pair problems
• New bounds for range closest-pair problems
• Searching for the closest-pair in a query translate
• Searching for the closest-pair in a query translate
• Approximate range closest-pair queries

Cites work

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

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)