Minimal triangulations of polygonal domains

Annals of Discrete Mathematics

Volumn 9, Issue C, 1980, Pages 121-123

  Klincsek, G T ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000775283     PISSN: 01675060     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0167-5060(08)70044-X     Document Type: Article

References (3)

1. E.L. Lloyd, On triangulations of a set of points in the plane, Proc. 18th Annu. Symp. on Foundations of Computer Science, IEEE 228–240.
2. Manacher, G.K., Zobrist, A.L., Neither the Greedy nor the Delaunay Triangulation of a planar point set approximates the optimal triangulation. Information Processing Letters 9 (1979), 31–34.
3. M.I. Shamos, Geometric complexity, Proceedings of the Seventh ACM Symposium on the Theory of Computing (1975) 224–233.