M. Dickerson, R. L. Drysdale, S. Mcelfresh, and E Welzl "Fast Algorithms for the Greedy Triangulation", Proc. 10th Annual ACM Symposium on Computational Geometry, June 1994, 211--220. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Algorithms for Proximity Problems in Higher Dimensions - Dickerson, Eppstein (1996) (10 citations) Self-citation (Dickerson) (Correct)
....= n. Smid also has an algorithm to solve this problem in k dimensional space in O( log n) k 2 ) amortized time and O(n(log n) k ) space [25] A solution to Problem 2 is also an important substep in one of the fast greedy triangulation algorithms of Dickerson, Drysdale, McElfresh, and Welzl [12]. For this application, k is not known in advance (the enumeration is terminated when the triangulation is complete) and the pairs are required in nondecreasing order of distance. Closely related to Problem 2 is the following problem recently investigated by Chazelle [8] and by Agarwal, Aronov, ....
M. Dickerson, R. L. Drysdale, S. Mcelfresh, and E Welzl "Fast Algorithms for the Greedy Triangulation", Proc. 10th Annual ACM Symposium on Computational Geometry, June 1994, 211--220.
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