Triangulations without minimum-weight drawing

Information Processing Letters

Volumn 74, Issue 5, 2000, Pages 183-189

  Wang, Cao An ^a   Chin, Francis Y ^b   Yang, Boting ^a  

^a MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); GRAPH THEORY;

MINIMUM-WEIGHT DRAWINGS; TRIANGULATION GRAPHS;

COMPUTATIONAL GEOMETRY;

EID: 0033713821     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00067-3     Document Type: Article

References (17)

1. P. Bose, G. Di Battista, W. Lenhart, G. Liotta, Constraints and representable trees, in: Proc. GD94, Lecture Notes in Comput. Sci., Vol. 894, Springer, Berlin, 1994, pp. 340-351.
2. G. Di Battista, W. Lenhart, G. Liotta, Proximity drawability: A survey, in: Proc. GD94, Lecture Notes in Comput. Sci., Vol. 894, Springer, Berlin, 1994, pp. 328-339.
3. G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis, Algorithms for automatic graph drawing: An annotated bibliography, Comput. Geometry: Theory Appl. 4 (1994) 235-282.
4. G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall, Englewood Cliffs, NJ, 1999.
5. M. Dillencourt, Toughness Delaunay triangulations, Discrete Comput. Geometry 5 (1990) 575-601.
6. P. Eades, S. Whitesides, The realization problem for Euclidean minimum spanning tree is NP-hard, in: Proc. 10th ACM Symp. on Computational Geometry, Stony Brook, NY, 1994, pp. 49-56.
7. H. ElGindy, G. Liotta, A. Lubiw, H. Meijer, S. Whitesides, Recognizing rectangle of influence drawable graphs, in: Proc. GD94, Lecture Notes in Comput. Sci., Vol. 894, Springer, Berlin, 1994, pp. 252-263.
8. I. Fary, On straight lines representations of planar graphs, Acta Sci. Math. (Szeged) 11 (1948) 229-233.
9. R. Gimikowski, Properties of some Euclidean proximity graphs, Pattern Recogn. Lett. 13 (1992) 417-423.
10. M. Keil, Computing a subgraph of the minimum-weight triangulation, Comput. Geometry: Theory Appl. 4 (1994) 13-26.
11. W. Lenhart, G. Liotta, Drawing outerplanar minimum-weight triangulations, Inform. Process. Lett. 57 (1996) 253-260.
12. W. Lenhart, G. Liotta, Drawable and forbidden minimum-weight triangulations, in: Proc. GD97, Lecture Notes in Cornput. Sci., Vol. 1353, Springer, Berlin, 1997, pp. 1-12.
13. D. Matula, R. Sokal, Properties of Gabriel graphs relevant to geographic variation research and the clustering of points in the plane, Geographical Anal. 12 (3) (1980) 205-222.
14. C. Monma, S. Suri, Transitions in geometric minimum spanning trees, in: Proc. 7th ACM Symp. on Computational Geometry, North Conway, NH, 1991, pp. 239-249.
15. F. Preparata, M. Shamos, Computational Geometry, Springer, Berlin, 1985.
16. C.A. Wang, F. Chin, Y. Xu, A new subgraph of minimum-weight triangulations, J. Combin. Optimization (1997) 115-127.
17. C.A. Wang, F. Chin, B.T. Yang, Maximum weight triangulation and graph drawing, Inform. Process. Lett. 70 (1) (1999) 17-22.