On reporting the \(L_1\) metric closest pair in a query rectangle

DOI10.1016/j.ipl.2013.12.006zbMath1302.68281OpenAlexW2059942099MaRDI QIDQ2446069

Ananda Swarup Das, Kishore Kothapalli, Prosenjit Gupta, Kannan Srinathan

Publication date: 15 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.12.006

zbMATH Keywords

computational geometryManhattan metricrange queriesclosest pair

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Range Aggregate Maximal Points in the Plane
• Sorted Range Reporting
• Optimal Succinctness for Range Minimum Queries
• Orthogonal range searching on the RAM, revisited
• Unnamed Item
• Unnamed Item

This page was built for publication: On reporting the \(L_1\) metric closest pair in a query rectangle