Math @ Duke

Publications [#235561] of Pankaj K. Agarwal
Papers Published
 Agarwal, PK; Aronov, B; Sharir, M; Suri, S, Selecting distances in the plane,
in Sixth Annual Symposium on Computational Geometry
(1990),
pp. 321331
(last updated on 2018/07/17)
Abstract: We describe a randomized algorithm for computing the kth smallest distance in a set of n points in the plane, based on the parametric search technique of Megiddo. The expected running time of our algorithm is O(n4/3 log8/3 n). A deterministic version of our procedure runs in time O(n3/2 log5/2 n). Both versions improve the previously best known upper bound of O(n9/5 log4/5 n) by Chazelle. A simple O(n log n) time algorithm for computing an approximation of the median distance is also presented.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

