On exclusion regions for optimal triangulations

Discrete Applied Mathematics

Volumn 109, Issue 1-2, 2001, Pages 49-65

  Scot Drysdale, R L ^a   McElfresh, Scott ^b   Snoeyink, Jack Scott ^c,d  

^a Dartmouth Department of Computer Science_Dartmouth College   (United Kingdom)

^b Muhlenberg College   (United Kingdom)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^d Brooks Computer Science Building   (United States)

Author keywords

Computational geometry; Greedy triangulation; Minimum weight triangulation

Indexed keywords

EID: 0347870425     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00236-5     Document Type: Article

References (20)

1. O. Aichholzer, Local properties of triangulations, CG'95, 11th European Workshop on Computational Geometry, Linz, 1995.
2. Aichholzer O., Aurenhammer F., Hainz R. New results on MWT subgraphs. Inform. Process. Lett. 69:1999;215-219.
3. R. Beirouti, J. Snoeyink, Implementations of the LMT heuristic for minimum weight triangulations, Proceedings of the 14th Annual ACM Symposium on Computational Geometry, 1998, pp. 96-105.
4. Chang R.C., Lee R.C.T. On the average length of Delaunay triangulations. BIT. 24:1984;269-273.
5. G. Das, D. Joseph, Which triangulations approximate the complete graph? Optimal Algorithms, Lecture Notes in Computer Science, Springer, Berlin, Vol. 401 (1989) 168-192.
6. R.L. Drysdale, G. Rote, O. Aichholzer, A simple linear time greedy triangulation algorithm for uniformly distributed points, IIG-Report-Series 408, Technishe Universitaet Graz, 1995.
7. Dickerson M., Drysdale R.L., McElfresh S., Welzl E. Fast greedy triangulation algorithms. Comput. Geometry: Theory Appl. 1997;67-86.
8. M. Dickerson, S. McElfresh, M. Montague, New algorithms and empirical findings on minimum weight triangulation heuristics, Proceedings of the 11th Annual ACM Symposium on Computational Geometry, 1995, pp. 238-247.
9. Dickerson M., Keil J.M., Montague M. A large subgraph of the minimum weight triangulation. Discrete Comput. Geom. 18:1997;289-304.
10. P. Gilbert, New results in planar triangulations, M.S. Thesis, University of Illinois, Urbana, IL, 1979.
11. M. Garey, D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.
12. Heath L., Pemmaraju S. New results for the minimum weight triangulation problem. Algorithmica. 1994;533-552.
13. Keil M. Computing a subgraph of the minimum weight triangulation. Comput. Geom.: Theory Appl. 4:1994;13-26.
14. G. Klincsek, Minimal triangulations of polygonal domains, Ann. Discrete Math. 9, 121-123.
15. Levcopoulos C. An. Ω (n) lower bound for the nonoptimality of the greedy triangulation Inform. Process. Lett. 25:1987;247-251.
16. Levcopoulos C., Krznaric D. Quasi-greedy triangulations approximating the minimum weight triangulation. J. Algorithms. 27:1998;303-338.
17. C. Levcopoulos, 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.
18. Manacher G., Zobrist A. Neither the greedy nor the Delaunay triangulation of the planar set approximates the optimal triangulation. Inform. Process. Lett. 9:1979;31-34.
19. Preparata F., Shamos M. Computational Geometry: An Introduction. 1985;Springer, Berlin.
20. C.A. Wang, An optimal algorithm for greedy triangulation of a set of points, Proceedings of the sixth Canadian Conference on Computational Geometry, 1994, pp. 332-338.