Fast greedy triangulation algorithms

Computational Geometry: Theory and Applications

Volumn 8, Issue 2, 1997, Pages 67-86

  Dickerson, Matthew T ^a   Scot Drysdale, Robert L ^b   McElfresh, Scott A ^b   Welzl, Emo ^c  

^a MIDDLEBURY COLLEGE   (United States)

^b DARTMOUTH COLLEGE   (United States)

^c FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0348050331     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(97)89149-3     Document Type: Article

References (42)

1. A. Aggarwal, L.J. Guibas, J. Saxe and P. Shor, A linear time algorithm for computing the Voronoi diagram of a convex polygon, Discrete Comput. Geom. 4 (1989) 591-604.
2. G. Barequet and M. Sharir, Piecewise-linear interpolation between polygonal slices, in: Proc. 10th ACM Symp. Comput. Geom. (1994) 93-102.
3. J. Bentley, D. Sanat and E. Williams Jr, The complexity of finding fixed-radius near neighbors, Inform. Process. Lett. 6 (1977) 209-213.
4. P.L. Chew, Constrained Delaunay triangulations, in: Proc. 3rd ACM Symp. Comput. Geom. (1987) 215-222.
5. R.C. Chang and R.C.T. Lee, On the average length of Delaunay triangulations, BIT 24 (1984) 269-273.
6. G. Das and D. Joseph, Which triangulations approximate the complete graph?, Optimal Algorithms, Lecture Notes in Computer Science 401 (1989) 168-192.
7. Dehne, Flach, J.-R. Sach and Valiveti, Analog parallel computational geometry, in: Proc. 5th Canadian Conf. Comput. Geom. (1993) 143-153.
8. M. Dickerson, Expected rank of the longest edge in the greedy triangulation, in: Proc. 4th Canadian Conf. Comput. Geom. (1992) 182-187.
9. M. Dickerson and R.S. Drysdale, Fixed-radius near neighbors search algorithms for points and segments, Inform. Process. Lett. 35 (1990) 269-273.
10. M. Dickerson, R.L. Drysdale and J.-R. Sack, Simple algorithms for enumerating interpoint distances and finding k nearest neighbors, Internat. J. Comput. Geom. Appl. 3 (1992) 221-239.
11. R.L. Drysdale, G. Rote and O. Aichholzer, A simple linear time greedy triangulation algorithm for uniformly distributed points, IIG-Report-Series 408, Technishe Universitaet Graz (1995).
12. R.D. Düppe and H.J. Gottschalk, Automatische Interpolation von Isolinien bei willkürlich verteilten Stützpunkten, Allgemeine Vermessungsnachrichten 77 (1970) 423-426.
13. M. Dickerson, S. McElfresh and M. Montague, New algorithms and empirical findings on minimum weight triangulation heuristics, in: Proc. 11th ACM Symp. Comput. Geom. (1995) 238-247.
14. P. Gilbert, New results in planar triangulations, MS Thesis, University of Illinois, Urbana, IL (1979).
15. S. Goldman, A space efficient greedy triangulation algorithm, Inform. Process. Lett. 31 (1989) 191-196.
16. L. Heath and S. Pemmaraju, New results for the minimum weight triangulation problem, Virginia Polytechnic Institute and State University, Department of Computer Science, TR 92-30 (1992), to appear in Algorithmica.
17. R. Jarvis, On the identification of the convex hull of a finite set of points in the plane, Inform. Process. Lett. 2 (1973) 18-21.
18. D. Kirkpatrick, A note on Delaunay and optimal triangulations, Inform. Process. Lett. 10 (1980) 127-128.
19. G. Klincsek, Minimal triangulations of polygonal domains, Ann. Discrete Math. 9 121-123.
20. D.T. Lee and A.K. Lin, Generalized Delaunay triangulations for planar graphs, Discrete Comput. Geom. 1 (1986) 201-217.
21. H.P. Lenhof and M. Smid, Enumerating the k-closest pairs optimally, in: Proc. 33rd FOCS (1992) 380-386.
22. C. Levcopoulos, An Ω(√n) lower bound for the nonoptimality of the greedy triangulation, Inform. Process. Lett. 25 (1987) 247-251.
23. C. Levcopoulos and D. Krznaric, The greedy triangulation can be computed from the Delaunay in linear time, Manuscript (1995).
24. C. Levcopoulos and A. Lingas, On approximating behavior of the greedy triangulation for convex polygons, Algorithmica 2 (1987) 175-193.
25. C. Levcopoulos and A. Lingas, Fast algorithms for greedy triangulation, BIT 32 (1992) 280-296.
26. C. Levcopoulos and A. Lingas, Greedy triangulation approximates the minimum weight triangulation and can be computed in linear time in the average case, Technical Report LU-CS-TR:92-105, Department of Computer Science, Lund University (1992).
27. A. Lingas, The greedy and Delaunay triangulations are not bad in the average case, Inform. Process. Lett. 22 (1986) 25-31.
28. A. Lingas, On approximating behavior and implementation of the greedy triangulation for convex planar point sets, in: Proc. 2nd ACM Symp. Comput. Geom. (1986) 72-79.
29. A. Lingas, A new heuristic for the minimum weight triangulation, SIAM J. Algebraic Discrete Meth. 8 (1986) 646-658.
30. A. Lingas, Greedy triangulation can be efficiently implemented in the average case, in: Proc. Graph-Theoretic Concepts in Computer Science (1988) 253-261.
31. E. Lloyd, On triangulations of a set of points in the plane, in: Proc. 18th FOCS (1977) 228-240.
32. G. Manacher and A. Zobrist, Neither the greedy nor the Delaunay triangulation of the planar set approximates the optimal triangulation, Inform. Process. Lett. 9 (1979) 31-34.
33. G. Manacher and A. Zobrist, Probabilistic methods with heaps for fast-average-case greedy algorithms, Advances in Computing Research 1 (1983) 261-278.
34. D.A. Plaisted and J. Hong, A heuristic triangulation algorithm, J. Algorithms 8 (1987) 405-437.
35. F. Preparata and M. Shamos, Computational Geometry: An Introduction (Springer, Berlin, 1985).
36. A. Rényi and R. Sulanke, Über die konvexe Hülle von n zufällig gewählten Punkten, I, Z. Wahrsch. Verw. Gebiete 2 (1963) 75-84.
37. J.S. Salowe, Enumerating distances in space, Internat. J. Comput. Geom. Appl. 2 (1992) 49-59.
38. C.A. Wang, Efficiently updating the constrained Delaunay triangulations, BIT 33 (1993) 238-252.
39. C.A. Wang, An optimal algorithm for greedy triangulation of a set of points, in: Proc. 6th Canadian Conf. Comput. Geom. (1994) 332-338.
40. Y.F. Wang and J.K. Aggarwal, Surface reconstruction and representation of 3D scenes, Pattern Recognition 19 (1986) 197-207.
41. C.A. Wang and L. Schubert, An optimal algorithm for constructing the Delaunay triangulation of a set of line segment, in: Proc. 3rd ACM Symp. Comput. Geom. (1987) 223-232.
42. P. Yoeli, Compilation of data for computer-assisted relief cartography, in: J.C. Davis and M.J. McCullagh, eds., Display and Analysis of Spatial Data (Wiley, New York, 1975).