Maximum weight triangulation and graph drawing

Information Processing Letters

Volumn 70, Issue 1, 1999, Pages 17-22

  Wang, Cao An ^a   Chin, Francis Y ^b   Yang, Bo Ting ^a  

^a MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; TREES (MATHEMATICS);

MAXIMUM WEIGHT TRIANGULATION;

COMPUTATIONAL GEOMETRY;

EID: 0033574360     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00037-X     Document Type: Article

References (7)

1. G. Di Battista, P. Eades, R. Tamassia, I. Tollos, Algorithms for automatic graph drawing: A annotated bibliography, Comput. Geom. Theory Appl. 4 (1994) 235-282.
2. P. Eades, S. Whitesides, The realization problem for Euclidean minimum spanning tree is NP-hard, Algorithmica 16 (1996) 60-82.
3. P. Gilbert, New results on planar triangulations, Technical Report ACT-15, Coord. Sci. Lab., University of Illinois at Urbana, 1979.
4. G. Klincsek, Minimal triangulations of polygonal domains, Annual Discrete Math. 9 (1980) 121-123.
5. C. Levcopoulos, A. Lingas, On approximation behavior of the greedy triangulation for convex polygon, Algorithmica 2 (1987) 175-193.
6. W. Lenhart, G. Liotta, Drawing outerplanar minimum weight triangulations, Inform. Process. Lett. 57 (1996) 253-260.
7. F. Preparata, M. Shamos, Computational Geometry, Springer, Berlin, 1985.