How to draw outerplanar minimum weight triangulations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1027, Issue , 1996, Pages 373-384

  Lenhart, William ^a   Liotta, Giuseppe ^b  

^a WILLIAMS COLLEGE   (United States)

^b Brown University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); GRAPH ALGORITHMS; TRIANGULATION;

COMBINATORIAL PROPERTIES; DUAL-TREE; LINEAR TIME; MINIMUM WEIGHT TRIANGULATION; OUTERPLANAR GRAPH; REGULAR POLYGON; STRAIGHT-LINE DRAWINGS;

GRAPH THEORY;

EID: 84947911911     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0021821     Document Type: Conference Paper

References (21)

1. O. Aichholzer, F. Aurenhammer, G. Rote, M. Taschwer. Trìangulations Intersect Nicely. Proceedings 11th ACM Symposium on Computational Geometry, Vancouver, Canada, 1995, pp. 220-229.
2. J.A. Bondy and U.S.R. Murty. Graph Theory with Applications. Elsevier Science, New York, 1976.
3. G. Di Battista, P. Eades, R. Tamassia and I.G. Tollis. Algorithms for Automatic Graph Drawing: An Annotated Bibliography. Computational Geometry: Theory and Applications, 4,1994, pp. 235-282.
4. M.T. Dickerson, S.A. McElfresh, M. Montague. New Algorithms and Empirical Findings on Minimum Weight Triangulations Heuristics. Proceedings 11th ACM Symposium on Computational Geometry, Vancouver, Canada, 1995, pp. 238-247.
5. P. Eades and S. Whitesides. The Realization Problem for Euclidean Minimum Spanning Tree is NP-hard. Proceedings 10th ACM Symposium on Computational Geometry, Stony Brook NY, USA, 1994, pp. 49-56.
6. M.R. Garey and D.S. Johnson. Computers and Intractability-A Guide to the Theory of NP- Completeness. Freeman, New York, 1979.
7. P.N. Gilbert. New Results in Planar Triangulations. M.Sc. Thesis, Coordinated Science Laboratory, University of Illinois, Urbana, IL, 1979.
8. L.S. Heath and S.V. Pemmaraju. New Results for the Minimum Weight Triangulation Problem. Algorithmic, 12, 1994 pp. 533-552.
9. J.M. Keil. Computing a Subgraph of the Minimum Weight Triangulation. Computational Geometry: Theory and Applications, 4, 1994, pp. 13-26.
10. D. G. Kirkpatrick. A Note on Delaunay and Optimal Triangulations. information Processing Letters, 10, 1980, pp. 127-128.
11. G.T. Klincsek. Minimal triangulations of Polygonal Domains. Ann. Discrete Math., 9, 1980, pp. 121-123.
12. C. Levcopoulos. An Ω(y√n) Lower Bound for the Nonoptimality of the Greedy Triangulation. Information Processing Letters, 25, 1987, pp. 247-251.
13. C. Levcopoulos and A. Lingas. On Approximation Behavior of the Greedy Triangulation for Convex Polygons. Algorithmica, 2, 1987, pp. 175-193.
14. A. Lingas. A Linear-Time Heuristic for Minimum Weight Triangulation of Convex Polygons. Proc. 23rd Allerton Conference on Computing, Communication, and Control, Urbana, 1985, pp. 480 -485.
15. A. Lingas. The Greedy and Delaunay Triangulations are not Bad in the Average Case. Information Processing Letters, 22, 1986, pp. 25-31.
16. A.Lingas. A New Heuristic for Minimum Weight Triangulation. SIAM J. Algebraic Discrete Methods, 8,1987, pp. 646-658.
17. E.L. Lloyd. On Triangulations of a Set of Points in the Plane. Proceedings of the 18th Conference on the Foundations of Computer Science, Providence, RI, 1977, pp. 228-240.
18. K. Manacher, L. Zobrist. Neither the Greedy nor the Delaunay Triangulation of a Planar Point Set Approximates the Optimal Triangulation. Information Processing Letters, 9, 1979, pp. 31-34.
19. H. Meŋer and D. Rappaport. Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points. Information Processing Letters, 42,1992, pp. 35-38.
20. C. Monma and S. Suri. Transitions in Geometric Minimum Spanning Trees. Proc. 7th ACM Symposium on Computational Geometry, 1991, pp. 239-249.
21. F. P. Preparata and M. I. Shamos, Computational Geometry - an Introduction. Springer-Verlag, New York, 1985.