Abstract

Let S be a set of n weighted points in the plane and let R be a query range in the plane. In the range closest pair problem, we want to report the closest pair in the set R∩S. In the range minimum weight problem, we want to report the minimum weight of any point in the set R∩S. We show that these two query problems are equivalent for query ranges that are squares, for data structures having Ω(log⁡n) query times. As a result, we obtain new data structures for range closest pair queries with squares.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.