M. Dickerson and R. L. Drysdale, "Enumerating k distances for n points in the plane", Proc. 7th Annual ACM Symposium on Computational Geometry, June 1991, 159--168. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Dynamic Algorithms in Computational Geometry - Chiang, Tamassia (1992) (54 citations) (Correct)
....techniques for maintaining the minimal L r distance of a point set in d dimensional space. The data structure of [153] uses O(n) space and supports updates in O(n 2=3 log n) time, by giving a method to compute the O(n 2=3 ) smallest distances defined by a set of n points in O(n log n) time. By [49,141], which show how to compute the n smallest distances in O(n log n) time, the update time is improved to O(n 1=2 log n) for arbitrary dimension. In [156] the update time is reduced to O(log d n log log n) amortized, while the space is slightly increased to (n log d n) We briefly describe ....
M.T. Dickerson and R.S. Drysdale, "Enumerating k distances for n points in the plane," Proc. ACM Symp. on Computational Geometry (1991), 234--238.
Algorithms for Proximity Problems in Higher Dimensions - Dickerson, Eppstein (1996) (10 citations) Self-citation (Dickerson) (Correct)
No context found.
M. Dickerson and R. L. Drysdale, "Enumerating k distances for n points in the plane", Proc. 7th Annual ACM Symposium on Computational Geometry, June 1991, 159--168.
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