Angles of planar triangular graphs

SIAM Journal on Discrete Mathematics

Volumn 9, Issue 3, 1996, Pages 349-359

  Di Battista, Giuseppe ^a,b,c   Vismara, Luca ^b,d  

^a ROMA TRE UNIVERSITY   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c UNIVERSITY OF BASILICATA   (Italy)

^d CNR   (Italy)

Author keywords

Angle; Delaunay triangulation; Graph drawing; Planar graph

Indexed keywords

OPTIMIZATION; TRIANGULATION;

INEQUALITY; INFORMETRICS; NONLINEAR PROBLEMS; PLANAR GRAPH;

GRAPH THEORY;

EID: 0030375767     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480194264010     Document Type: Article

References (27)

1. F. J. BRANDENBURG, P. KLEINSCHMIDT, AND U. SCHNIEDERS, Drawing planar graphs with wide angles, Manuscript, 1991.
2. G. R. BRIGHTWELL AND E. R. SCHEINERMAN, Representation of planar graphs, SIAM J. Discrete Math., 6 (1993), pp. 214-229.
3. H. DE FRAYSSEIX, J. PACH, AND R. POLLACK, How to draw a planar graph on a grid, Combinatorica, 10 (1990), pp. 41-51.
4. B. DELAUNAY, Sur la sphère vide, Izv. Akad. Nauk SSSR, VII Seria, Otdel. Mat. i Estestvennyka Nauk, 7 (1934), pp. 793-800.
5. G. DI BATTISTA, P. EADES, R. TAMASSIA, AND I. G. TOLLIS, Algorithms for drawing graphs: An annotated bibliography, Comput. Geom. Theory Appl., 4 (1994), pp. 235-282.
6. M. B. DILLENCOURT, Graph-Theoretical Properties of Algorithms Involving Delaunay Triangulations, Tech. Report CS-TR-2059, Institute for Advanced Computer Studies, University of Maryland, College Park, MD, 1988.
7. _, Toughness and Delaunay triangulations, Discrete Comput. Geom., 5 (1990), pp. 575-601.
8. M. B. DILLENCOURT AND I. RIVIN, Personal communication, 1992.
9. I. FARY, On straight lines representation of planar graphs, Acta Sci. Math. (Szeged), 11 (1948), pp. 229-233.
10. M. FORMANN, T. HAGERUP, J. HARALAMBIDES, M. KAUFMANN, F. T. LEIGHTON, A. SIMVONIS, E. WELZL, AND G. WOEGINGER, Drawing graphs in the plane with high resolution, SIAM J. Comput., 22 (1993), pp. 1035-1052.
11. A. GARG, On drawing angle graphs, in Graph Drawing, in Proc. DIMACS International Workshop on Graph Drawing, Princeton, NJ, Lecture Notes in Computer Science 894, R. Tamassia and I. G. Tollis, eds., Springer-Verlag, Berlin, New York, 1995, pp. 84-95.
12. A. GARG AND R. TAMASSIA, Planar drawings and angular resolution: Algorithms and bounds, in Algorithms, Proceedings of the 2nd Annual European Symposium on Algorithms, Utrecht, the Netherlands, Lecture Notes in Computer Science 855, J. van Leeuwen, ed., Springer-Verlag, Berlin, New York, 1994, pp. 12-23.
13. C. D. HODGSON, I. RIVIN, AND W. D. SMITH, A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere, Bull. Amer. Math. Soc., 27 (1992), pp. 246-251.
14. _, Erratum (A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere), Bull. Amer. Math. Soc., 28 (1993), p. 213.
15. G. KANT, Drawing planar graphs using the Imc-ordering, in Proc. 33rd Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh, PA, 1992, pp. 101-110.
16. _, Drawing planar graphs using the canonical ordering, Algorithmica (special issue on Graph Drawing, G. Di Battista and R. Tamassia, eds.), to appear.
17. S. MALITZ AND A. PAPAKOSTAS, On the angular resolution of planar graphs, SIAM J. Discrete Math., 7 (1994), pp. 172-183.
18. B. MOHAR, A polynomial time circle packing algorithm, Discrete Math., 117 (1993), pp. 257-263.
19. T. NISHIZEKI AND N. CHIBA, Planar Graphs: Theory and Algorithms, Annals of Discrete Mathematics, Vol. 32, North-Holland, Amsterdam, 1988.
20. W. SCHNYDER, Planar graphs and poset dimension, Order, 5 (1989), pp. 323-343.
21. _, Embedding planar graphs on the grid, in Proc. 1st ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 1990, pp. 138-148.
22. S. K. STEIN, Convex maps, Proc. Amer. Math. Soc., 2 (1951), pp. 464-466.
23. E. STEINITZ AND H. RADEMACHER, Vorlesungen über die Theorie der Polyeder, Julius Springer, Berlin, Germany, 1934.
24. W. T. TUTTE, Convex representations of graphs, Proc. London Math. Soc., 10 (1960), pp. 304-320.
25. W. T. TUTTE, How to draw a graph, Proc. London Math. Soc., 13 (1963), pp. 743-768.
26. G. VIJAYAN, Geometry of planar graphs with angles, in Proc. 2nd Annual ACM Symposium on Computational Geometry, Yorktown Heights, NY, 1986, pp. 116-124.
27. K. WAGNER, Bemerkungen zum vierfarbenproblem, Jahresber. Deutsch. Math.-Verein., 46 (1936), pp. 26-32.