Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation

Journal of Algorithms

Volumn 27, Issue 2, 1998, Pages 303-338

  Levcopoulos, Christos ^a   Krznaric, Drago ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0006936254     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0918     Document Type: Article

References (22)

1. M. Bern and D. Eppstein, Approximation algorithms for geometric problems, in "Approximation Algorithms for NP-Hard Problems" (D. S. Hochbaum, Ed.), PWS-Kent, Boston, MA, 1995.
2. R. C. Chang and R. C. T. Lee, On the average length of Delaunay triangulations, BIT 24(3) (1984), 269-273.
3. M. T. Dickerson, R. L. S. Drysdale, S. A. McElfresh, and E. Welzl, Fast greedy triangulation algorithms, in "Proceedings of the Tenth Annual ACM Symposium on Computational Geometry," pp. 211-220, 1994.
4. M. T. Dickerson and M. H. Montague, A (usually?) connected subgraph of the minimum weight triangulation, in "Proceedings of the Twelfth Annual ACM Symposium on Computational Geometry," pp. 204-213, 1996.
5. D. Eppstein, Approximating the minimum weight triangulation, Discrete Comput. Geom. 11 (1994), 163-191.
6. P. D. Gilbert, "New Results in Planar Triangulations," Master's thesis, University of Illinois, Urbana, IL, 1979.
7. L. Heath and S. Pemmaraju, New results for the minimum weight triangulation problem, Algorithmica 12(6) (1994), 533-552.
8. D. G. Kirkpatrick, A note on Delaunay and optimal triangulations, Inform. Process. Lett. 10(3) (1980), 127-128.
9. C. Levcopoulos, "Heuristics for Minimum Decomposition of Polygons," Ph.D. thesis, Linköping University, Linköping, Sweden, 1987.
10. C. Levcopoulos, An Ω(√n) lower bound for the nonoptimality of the greedy triangulation, Inform. Process. Lett. 25(4) (1987), 247-251.
11. C. Levcopoulos and D. Krznaric, A fast heuristic for approximating the minimum weight triangulation, in "Proceedings of the Fifth Scandinavian Workshop on Algorithm Theory," Lecture Notes in Computer Science, Vol. 1097, pp. 296-308, Springer-Verlag, Berlin/New York, 1996.
12. C. Levcopoulos and D. Krznaric, Tight lower bounds for minimum weight triangulation heuristics, Inform. Process. Lett. 57(3) (1996), 129-135.
13. C. Levcopoulos and A. Lingas, On approximation behavior of the greedy triangulation for convex polygons, Algorithmica 2(2) (1987), 175-193.
14. C. Levcopoulos and A. Lingas, "The 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, Lund, Sweden, 1992. A preliminary version appeared in Proc. ICCI '91, LNCS 497, Springer-Verlag, Berlin/New York, 1991.
15. C. Levcopoulos and A. Lingas, "C-Sensitive Triangulations Approximate the Minmax Length Triangulation," Technical Report LU-CS-TR:93-118, Department of Computer Science, Lund University, Lund, Sweden, 1993. A preliminary version appeared in Proc. FST-TCS '92, LNCS 652, pp. 104-115, Springer-Verlag, Berlin/New York, 1992.
16. A. Lingas, A new heuristic for the minimum weight triangulation, SIAM J. Algebraic Discrete Methods 8 (1987), 646-658.
17. E. L. Lloyd, On triangulations of a set of points in the plane, in "Proceedings of the Eighteenth Annual IEEE Symposium on Foundations of Computer Science," pp. 228-240, 1977.
18. 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(1) (1979), 31-34.
19. D. A. Plaisted and J. Hong, A heuristic triangulation algorithm, J. Algorithms 8(3) (1987), 405-437.
20. F. P. Preparata and M. I. Shamos, "Computational Geometry: An Introduction," Springer-Verlag, New York, 1985.
21. W. D. Smith, "Studies in Computational Geometry Motivated by Mesh Generation," Ph.D. thesis, Princeton University, 1989.
22. P. Yoeli, Compilation of data for computer-assisted relief cartography, in "Display and Analysis of Spatial Data" (J. C. Davis and M. J. McCullagh, Eds.), Wiley, New York, 1975.