Drawable and forbidden minimum weight triangulations

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

Volumn 1353, Issue , 1997, Pages 1-12

  Lenhart, William ^a   Liotta, Giuseppe ^b  

^a WILLIAMS COLLEGE   (United States)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); TRIANGULATION;

DELAU-NAY TRIANGULATIONS; DELAUNAY; LINEAR TIME; MINIMUM WEIGHT; MINIMUM WEIGHT TRIANGULATION; NON-TRIVIAL; STRAIGHT-LINE DRAWINGS;

SURVEYING;

EID: 33847548892     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63938-1_45     Document Type: Conference Paper

References (27)

1. O. Aichholzer, F. Aurenhammer, S.-W. Chert, N. Katoh, M. Taschwer, G. Rote, and Y.-F. Xu. Triangulations intersect nicely. Discrete Comput. Geom., 16:339-359, 1996.
2. P. Bose, G. Di Battista, W. Lenhart, and G. Liotta. Proximity constraints and representable trees. In R. Tamnssin and I. G. Tollis, editors, Graph Drawing (Prec. GD '9J), volume 894 of Lecture Note# Comput. Sci., pages 340-351. Springer- Vexlag, 1995.
3. P. Bose, W. Lenhart, and G. Liotta. Characterizing proximity trees. Algorithmica, 16:83-110, 1996. (special issue on Graph Drawing, edited by G. Di Battista and IL Tamassia).
4. S.-W. Cheng and Y.-F. Xu. Approaching the largest β-skeleton within a minimum weight triangulation. In Proc. 12th Annu. ACM Spmpos. Comput. Geom., pages 196-203, 1996.
5. G. Di Battista, W. Lenlaart, and G. Liotta. Proximity drawability: a survey. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proe. GD '94), volume 894 of £eeture Notes Compnt. Sci., pages 328-339. Springer-Verlag, 1995.
6. G. Di Battista, G. Liotta, and S. H. Whitesides. The strength of weak proximity. In F. J. Brandenburg, editor, Graph Drawing (Proe. GD '95), volume 1027 of Lecture Notes Comput. Sci., pages 178-189. Springer-Verlng, 1996.
7. G. Di Battista and L. Vismara. Angles of planar triangular graphs. SIAM J. Discrete Math., 9(3):349-359, 1996.
8. M. T. Dickerson, S. A. McElfzesh, and M. H. Montague. New algorithms and empirical findings on minimum weight triangulation heuristics. In Proc. 11th Annu. ACM Sprnpos. Comput. Geom., pages 238-247, 1995.
9. M. T. Dickerson and M. H. Montague. A (usually?) connected subgraph of the minimum weight triangulation. In Proe. 12th Annu. ACM Spmpos. Comput. Geom., pages 204-213, 1996.
10. M. B. Dillencourt. Realizability of Delaunay triangulations. Inform. Process. Left., 33:283-287, 1990.
11. M. B. Dillencourt. Toughness and Delaunay triangulations. Discrete Comlrst. Geom., 5:575-601, 1990.Springex-Vexlag, 1997.
12. M. B. DUlencourt and W. D. Smith. Graph-theoretical conditions for inscribability and Delaunay reaUzability. In Proc. 6th Canad. Conf. Comput. Geom., pages 287-292, 1994.
13. P. Eades and S. Whitesides. The realization problem for Euclidean minimum spanning trees is NP-hard. Algorithmica, 16:60-82, 1996. (special issue on Graph Drawing, edited by G. Di Battista and R. Tamassia).
14. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completed. W. H. Freeman, New York, NY, 1979.
15. M. Keil Computing a subgraph of the minimum weight triangulation. Comput. Geom. Theory AppL, 4:13-26, 1994.
16. D. G. Kirkpatrick. A note on Delaunay and optimal triangulations. Inform. Process. Left., 10:127-128, 1980.
17. W. Lenhart and G. Liotta. Drawing outerplanar minimum weight triangulations. Inform. Process. Lett., 6(12):253-260, 1996.
18. W. Lenhart and G. Liotta. How to draw outerplanar minimum weight triangulations. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes Comput. Sci., pages 373-384. Springer-Verlag, 1996.
19. W. Lenhart and G. Liotta. Proximity drawings of outerplanar graphs. In S. North, editor, Graph Drawing (Proc. GD '96), volume 1190 of Lecture Notes Comput. Sci., pages 286-302. Springex-Vexlag, 1997.
20. C. Levcopoulos and D. Krznaric. Quasi-greedy triangulations approximating the minimum weight triangulation. In Proc. 7th ACM-SIAM Sympos. Discrete Algorithm J, pages 392-401, 1996.
21. C. Levcopoulos and D. Krznaric. Tight lower bounds for minimum weight triangulation heuristics. I, formation Processing Letters, (57):129-135, 1996.
22. A. Lingas. A new heuristic for minimum weight triangulation. SIAM J. Algebraic Discrete Methods, 8(4):646-658, 1987.
23. G. Liotta and G. Di Battista. Computing proximity drawings of trees in the 3- dimensional space. In Proc. 4th Workshop Algorithm8 Data Struct., volume 955 of Lecture Notes Comput. Sci., pages 239-250. Springer-Verlag, 1995.
24. G. Liotta, R Tamassia, I. G. Tollis, and P. Vocca. Area requirement of Gabriel drawings. In Algorithms and Complexity (Proc. CIAC' 97), volume 955 of Lecture Notes Comput. Sci., pages 239-250. Springer-Vexlag, 1995.
25. A. Lubiw and N. Sleumer. Maximal outerplanar gsaphs are relative neighborhood graphs. In Proc. 5th Canad. Conf. Comput. Geom., pages 198-203, 1993.
26. H. Metier and D. Rappaport. Computing the minimum weight triangulation of a set of linearly ordered points. Information Processing Letters, (42):35-38, 1992.
27. C. Monma and S. Suri. Transitions in geometric minimum spanning trees. Discrete Comput. Geom., 8:265-293, 1992