H-P Lenhof and M. Smid, "Enumerating the k closest pairs optimally," em Max-Planck-Institut fur Informatik MPI-I-92-118 May 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Algorithms for Proximity Problems in Higher Dimensions - Dickerson, Eppstein (1996) (10 citations) (Correct)
....a given distance of each other. The problem was originally solved by Bentley, Stanat, and Williams [5] in worst case time O(3 d dn log n 3 d k) where d is the dimension and k the number of pairs reported. Algorithms for problem 1 have also been used by Salowe [21, 22] and Lenhof and Smid [17] as subroutines in parametric search methods for solving Problems 2 and 4. Problem 3 is a generalization of the well known nearest neighbors problem. For classification problems, it is more robust than a simple nearest neighbors search. The graph of k nearest neighbors to each point has certain ....
....not enumerated in order. As a sub step, Salowe also presents an algorithm to solve Problem 1, the fixed radius nearneighbor search problem, in time O(n log n k) for L p metrics in d dimensions. This algorithm was inspired by Vaidya s optimal all nearest neighbors algorithm [26] Lenhof and Smid [17] have also presented an algorithm to compute the k closest pairs (k known in advance and the pairs not generated in order) in O(n log n k) time, using an approach similar to that of Salowe. Our paper presents algorithms with similar asymptotic running times, using different methods than those ....
[Article contains additional citation context not shown here]
H-P Lenhof and M. Smid, "Enumerating the k closest pairs optimally," em Max-Planck-Institut fur Informatik MPI-I-92-118 May 1992.
Fast Greedy Triangulation Algorithms - Dickerson, Drysdale, McElfresh.. (1994) (14 citations) (Correct)
.... it generates possible edges in increasing order using an algorithm of Dickerson, Drysdale, and Sack [8] Algorithms to enumerate the k closest interpoint pairs have been invented by Salowe and by Lenhof and Smid, but because they need to know k in advance they are less appropriate in this context [32, 17]. When the number of pairs of not closed points is proportional to the number of pairs already examined, it starts over, enumerating pairs of not closed points in increasing order (similar to Step 2 0 above) How do we know when to switch over We keep track of the number of points which are ....
H. P. Lenhof, M. Smid, "Enumerating the k-closest pairs optimally." Proceedings of the 33rd FOCS , (1992) 380--386.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC