Selecting distances in the plane

Abstract

We describe a randomized algorithm for computing the <italic>k</italic><supscrpt>th</supscrpt> smallest distance in a set of <italic>n</italic> points in the plane, based on the parametric search technique of Megiddo [Me1]. The expected running time of our algorithm is <italic>&Ogr;</italic>(<italic>n</italic><supscrpt>4/3</supscrpt> log <supscrpt>8/3… (More)
DOI: 10.1007/BF01187037