Angles of planar triangular graphs

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 431-437

  Di Battista, Giuseppe ^a   Vismara, Luca ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTERIZATION; COMPUTATION THEORY; NONLINEAR PROGRAMMING; OPTIMIZATION; COMPUTATIONAL METHODS; COMPUTER GRAPHICS; CONSTRAINT THEORY; DRAWING (GRAPHICS); MATHEMATICAL MODELS;

LINEAR TIME; MINIMALITY; NON-LINEAR OPTIMIZATION PROBLEMS; PLANAR DRAWING; SOLUTION SPACE; SYSTEM OF EQUATIONS;

PROBLEM SOLVING; GRAPH THEORY;

PLANAR TRIANGULAR GRAPH ANGLES;

EID: 0027150410     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167207     Document Type: Conference Paper

References (22)

1. F.J. Brandenburg, P. Kleinschmidt, and U. Schnieders, "Drawing Planar Graphs with Wide Angles, " Manuscript, 1991.
2. H. de Fraysseix, J. Pach, and R. Pollack, "Small Sets Supporting Fary Embeddings of Planar Graphs, " Proc. 20th ACM Symp. on Theory of Computing, pp. 426-433, 1988.
3. H. de Fraysseix, J. Pach, and R. Pollack, "How to Draw a Planar Graph on a Grid, " Combinatorica, vol. 10, pp. 41-51, 1990.
4. M.B. Dillencourt, "Graph-Theoretical Properties of Algorithms Involving Delaunay Triangulations, " Tech. Rep. CS-TR-2059, University of Maryland, 1988.
5. M.B. Dillencourt, "Toughness and Delaunay Triangulations, " Discrete fc Computational Geometry, vol. 5, no. 6, pp. 575-601, 1990.
6. M.B. Dillencourt and I. Rivin, Personal Communication, 1992.
7. P. Eades and R. Tamassia, "Algorithms for Automatic Graph Drawing: An Annotated Bibliography, " Technical Report CS-89-09, Dept. of Computer Science, Brown Univ., 1989.
8. I. Fary, "On Straight Lines Representation of Planar Graphs, " Acta Sd. Math. Szeged, vol. 11, pp. 229233, 1948.
9. M. Formann, T. Hagerup, J. Haralambides, M. Kauf- mann, F.T. Leighton, A. Simvonis, E. Welzl, and G. Woeginger, "Drawing Graphs in the Plane with High Resolution, " Proc. IEEE Symp. on Foundations of Computer Science, pp. 86-95, 1990.
10. C.D. Hodgson, I. Rivin, and W.D. Smith, "A Characterization of Convex Hyperbolic Polyhedra and od Convex Polyhedra Inscribed in the Sphere, " Bull, of the American Mathematical Society, vol. 27, no. 2, pp. 246-251, 1992.
11. G. Kant, "A New Method for Planar Graph Drawings on a Grid, " Proc. IEEE Symp. on Foundations of Computer Science, 1992.
12. S. Malitz and A. Papakostas, "On the Angular Resolution of Planar Graphs, " Proc. 24th ACM Symp. on the Theory of Computing, pp. 527-538, 1992.
13. B. Mohar, "Circle packings of maps in polynomial time, " Manuscript, submitted to the Bull, of the American Mathematical Society.
14. T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithms, Annals of Discrete Mathematics, North Holland, 1988.
15. W. Schnyder, "Embedding Planar Graphs on the Grid, " Proc. ACM- SIAM Symp. on Discrete Algorithms, pp. 138-148, 1990.
16. S.K. Stein, "Convex Maps, " Proc. Amer. Math. Soc., vol. 2, pp. 464-466, 1951.
17. E. Steinitz and H. Rademacher, Vorlesung uber die Theorie der Polyeder, Springer, Berlin, 1934.
18. R. Tamassia, G. Di Battista, and C. Batini, "Automatic Graph Drawing and Readability of Diagrams, " IEEE Transactions on Systems, Man and Cybernetics, vol. SMC-18, no. 1, pp. 61-79, 1988.
19. W.T. Tutte, "Convex Representations of Graphs, " Proc. London Math Soc., vol. 10, pp. 304-320, 1960.
20. W.T. Tutte, "How to Draw a Graph, " Proc. London Math Soc., vol. 3, no. 13, pp. 743-768, 1963.
21. G. Vijayan, "Geometry of Planar Graphs with Angles, " Proc. ACM Symp. on Computational Geometry, pp. 116-124, 1986.
22. K. Wagner, "Bemerkungen zum Vierfarbenprob- lem, " Jber. Deutsch. Math.-Verein, vol. 46, pp. 2632, 1936.