Tight lower bounds for minimum weight triangulation heuristics

Information Processing Letters

Volumn 57, Issue 3, 1996, Pages 129-135

  Levcopoulos, Christos ^a   Krznaric, Drago ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

Computational geometry; Delaunay triangulation; Greedy triangulation; Minimum weight triangulation

Indexed keywords

EID: 0006892634     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(95)00200-6     Document Type: Article

References (14)

1. G. Das and D. Joseph, Which triangulations approximate the complete graph, in; it Proc. Internat. Symp. on Optimal Algorithms, Lecture Notes in Computer Science 401 (Springer, Berlin, 1989) 168-183.
2. P.D. Gilbert, New results in planar triangulations, Master's Thesis, University of Illinois, Urbana, 1979.
3. L. Heath and S. Pemmaraju, New results for the minimum weight triangulation problem. Algorithmica 12 (1994) 533-552.
4. D.G. Kirkpatrick, A note on Delaunay and optimal triangulations, Inform. Process. Lett. 10 (19800 127-128.
5. C. Levcopoulos, An Ω(√n) lower bound for the nonoptimality of the greedy triangulation, Inform. Process. Lett. 25 (1987) 247-251.
6. C. Levcopoulos and D. Krznaric, The greedy triangulation can be computed from the Delaunay in linear time, Tech. Rept. LU-CS-TR:94-136, Dept. of Computer Science, Lund University, Sweden, 1994.
7. C. Levcopoulos and D. Krznaric, Quasi-greedy triangulations approximating the minimum weight triangulation, Tech. Rept. LU-CS-TR:95-155, Dept. of Computer Science, Lund University, Sweden, 1995.
8. A. Lingas, A new heuristic for the minimum weight triangulation, SIAM J. Algebraic Discrete Methods 8 (1987) 646-658.
9. E.L. Lloyd, On triangulations of a set of points in the plane, in: Proc. 18th FOCS (1977) 228-240.
10. G.K. Manacher and A.L. Zobrist, Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation, Inform. Process. Lett. 9 (1979) 31-34.
11. D.A. Plaisted and J. Hong, A heuristic triangulation algorithm, J. Algorithms 8 (1987) 405-437.
12. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction (Springer, New York, 1985).
13. W.D. Smith, Studies in computational geometry motivated by mesh generation, Ph.D. Thesis, Princeton University, 1989.
14. 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).