Two-dimensional closest pair problem: a closer look

DOI10.1016/j.dam.2020.08.006zbMath1458.68265OpenAlexW3080461791MaRDI QIDQ2004080

Ovidiu Daescu, Ka Yaw Teo

Publication date: 14 October 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.08.006

zbMATH Keywords

two dimensionsclosest pairgeometric bound

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved algorithm for finding the closest pair of points
• An optimized divide-and-conquer algorithm for the closest-pair problem in the planar case