A Simple Randomized $O(n \log n)$--Time Closest-Pair Algorithm in Doubling Metrics

DOI10.20382/JOCG.V11I1A20zbMath1497.68510OpenAlexW4288083348MaRDI QIDQ3387270

Anil Maheshwari, Wolfgang Mulzer, Michiel H. M. Smid

Publication date: 12 January 2021

Full work available at URL: https://arxiv.org/abs/2004.05883

Mathematics Subject Classification ID

Metric spaces, metrizability (54E35) Randomized algorithms (68W20) Computational aspects of digital topology (68U03)

This page was built for publication: A Simple Randomized $O(n \log n)$--Time Closest-Pair Algorithm in

 Doubling Metrics