Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
Given a sequence of n points that form the vertices of a simple polygon, we show that determining a closest pair requires Ω(n log n) time in the algebraic decision tree model. Together with the well-known O(n log n) upper bound for finding a closest pair, this settles an open problem of Lee and Preparata. We also extend this O(n log n) upper bound to the following problem: Given a collection of sets with a total of n points in the plane, find for each point a closest neighbor that does not belong to the same set. © 1992.
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Thomas R. Puzak, A. Hartstein, et al.
CF 2007
Zohar Feldman, Avishai Mandelbaum
WSC 2010