A large subgraph of the minimum weight triangulation

Discrete and Computational Geometry

Volumn 18, Issue 3, 1997, Pages 289-304

  Dickerson, M T ^a   Keil, J M ^b   Montague, M H ^a  

^a MIDDLEBURY COLLEGE   (United States)

^b UNIVERSITY OF SASKATCHEWAN   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031492516     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009320     Document Type: Article

References (20)

1. O. Aichholzer, F. Aurenhammer, M. Taschwer, and G. Rote, Triangulations intersect nicely. Proc. 11th Annual Symposium on Computational Geometry, 1995, pp. 238-247.
2. P. Belleville, M. Keil, M. McAllister, and J. Snoeyink, On computing edges that are in all minimum-weight triangulations. Proc. 12th Annual Symposium on Computational Geometry, 1996, pp. V7-V8; and The 5th Annual Video Review of Computational Geometry.
3. P. Belleville, M. Keil, M. McAllister, and J. Snoeyink, On computing edges that are in all minimum-weight triangulations. Proc. 12th Annual Symposium on Computational Geometry, 1996, pp. V7-V8; and The 5th Annual Video Review of Computational Geometry.
4. M. Bern and D. Eppstein, Mesh generation and optimal triangulations. In Computing in Euclidean Geometry, Ding-Zhu and F. Hwang, eds. World Scientific, Singapore, 1992, pp. 23-90.
5. P. Bose, L. Devroye, and W. Evans, Diamonds are not a minimum weight triangulation's best friend. TR 96-01, Dept. of Computer Science, University of British Columbia, January 1995.
6. S. Cheng and Y. Xu, Approaching the largest β-skeleton within the minimum weight triangulation. Proc. 12th Annual Symposium on Computational Geometry, 1996, pp. 196-203.
7. S. Cheng, M. Golin, and J. Tsang, Expected case analysis of β-skeletons with applications to the construction of minimum weight triangulations. Proc. 7th Canadian Conference on Computational Geometry, 1995, pp. 279-284.
8. N. Chiba and T. Nishizeki, Arboricity and subgraph listing algorithms. SIAM J. Comput. 14 (1985), 210-223.
9. G. Das and D. Joseph Which Triangulations Approximate the Complete Graph? Lecture Notes in Computer Science, Vol. 401, Springer-Verlag, Berlin, 1989, pp. 168-192.
10. M. Dickerson, S. Drysdale, S. McElfresh, and E. Welzl, Fast greedy triangulation algorithms. Comput. Geom. Theory Appl., to appear.
11. M. Dickerson, S. McElfresh, and M. Montague, New algorithms and empirical findings on minimum weight triangulations. Proc. 11th Annual Symposium on Computational Geometry, 1995, pp. 278-284.
12. M. Dickerson and M. Montague, A (usually?) connected subgraph of the minimum weight triangulation. Proc. 12th Annual Symposium on Computational Geometry, 1995, pp. 204-213.
13. D. Eppstein, M. Overmars, G. Rote, and G. Woeginger, Finding minimum area k-gons. Discrete Comput. Geom. 7 (1992), 45-58.
14. M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
15. P. D. Gilbert, New results in planar triangulations. Report R-850, University of Illinois Coordinated Science Laboratory, 1979.
16. J. M. Keil, Computing a subgraph of the minimum weight triangulation. Comput. Geom. Theory Appl. 4 (1994), 13-26.
17. G. Klincsek, Minimal triangulations of polygonal domains. Ann. Discrete Math. 9 (1980), 121-123.
18. S. McElfresh. Personal communication. St. Lawrence University, Work in progress.
19. G. Rote, Personal correspondence, 1996.
20. B.-T. Yang, Y.-F. Xu, and Z.-Y. You, A chain decomposition algorithm for the proof of a property on minimum weight triangulations. Algorithms and Computation (Conf. Proc., Beijing, 1994). Lecture Notes in Computer Science, Vol. 834. Springer-Verlag, Berlin, 1994, pp. 423-427.