New bounds for range closest-pair problems

DOI10.1007/s00454-022-00388-7OpenAlexW2778261679MaRDI QIDQ2671166

Saladi Rahul, Ravi Janardan, Jie Xue, Yu'an Li

Publication date: 3 June 2022

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-022-00388-7

zbMATH Keywords

geometric data structuresclosest pairrange search

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data structures for range-aggregate extent queries
• On the power of the semi-separated pair decomposition
• Approximate range closest-pair queries
• Optimal Point Location in a Monotone Subdivision
• New Bounds for Range Closest-Pair Problems
• Colored range closest-pair problem under general distance functions
• Searching for the closest-pair in a query translate

This page was built for publication: New bounds for range closest-pair problems