On drawing angle graphs

  • Ashim Garg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 894)

Abstract

An Angle graph is a graph with a fixed cyclic order of edges around each vertex and an angle specified for every pair of consecutive edges incident on each vertex. We study the problem of constructing a drawing of an angle graph that preserves its angles, and present several new results.

References

  1. 1.
    R.F. Cohen, G. Di Battista, R. Tamassia, I.G. Tollis, and P. Bertolazzi, “A Framework for Dynamic Graph Drawing,” Proc. ACM Symp. on Computational Geometry, 1992, pp. 261–270.Google Scholar
  2. 2.
    I.F. Cruz, A. Garg, “Drawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs,” Graph Drawing '94 (Proc. DIMACS Workshop on Graph Drawing), to appear.Google Scholar
  3. 3.
    G. Di Battista, P. Eades, R. Tamassia and I.G. Tollis, “Algorithms for Drawing Graphs: An Annotated Bibliography,” Comp. Geom. Theory Appl., to appearGoogle Scholar
  4. 4.
    G. Di Battista, R. Tamassia, and I.G. Tollis, “Area Requirement and Symmetry Display of Planar Upward Drawings,” Disc. & Comp. Geom., vol. 7, 1992.Google Scholar
  5. 5.
    G. Di Battista and L. Vismara, “Angles of Planar Triangular Graphs,” Proc. ACM Symp. on Theory of Computing, 1993.Google Scholar
  6. 6.
    P. Eades and T. Lin. “Algorithmic and declarative approaches to aesthetic layout,” Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing).Google Scholar
  7. 7.
    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,” Proc. FOCS, 1990, pp. 86–95.Google Scholar
  8. 8.
    A. Garg, M.T. Goodrich, and R. Tamassia, “Area-efficient Upward Tree Drawings”, Proc. ACM Symp. on Computational Geometry, 1993, pp. 359–368.Google Scholar
  9. 9.
    A. Garg and R. Tamassia, “Planar Drawings and Angular Resolution: Algorithms and Bounds”, European Symposium on Algorithms, 1994.Google Scholar
  10. 10.
    M.R. Gary and D.S. Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness,” W.H. Freeman, New York, NY 1979.Google Scholar
  11. 11.
    M. Himsolt, “A View to Graph Drawing Algorithms Through GraphEd”, Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing), Paris, 1993.Google Scholar
  12. 12.
    T. Kamada. On Visualization of Abstract Objects and Relations. PhD thesis, Department of Information Science, University of Tokyo, 1988.Google Scholar
  13. 13.
    G. Kant. Drawing planar graphs using the lmc-ordering. In Proc. 33th Annu. IEEE Sympos. Found. Comput. Sci., pages 101–110, 1992.Google Scholar
  14. 14.
    C.E. Leiserson, “Area-Efficient Graph Layouts (for VLSI),” Proc. IEEE Symp. on Foundations of Computer Science, 1980, pp. 270–281.Google Scholar
  15. 15.
    S.M. Malitz and A. Papakostas, “On the Angular Resolution of Planar Graphs,” Proc. ACM Symp. on Theory of Computing, 1992, pp. 527–538.Google Scholar
  16. 16.
    R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421–444, 1987.Google Scholar
  17. 17.
    R. Tamassia and I. G. Tollis. A unified approach to visibility representations of planar graphs. Discrete Comput. Geom., 1(4):321–341, 1986.Google Scholar
  18. 18.
    L. Valiant, “Universality Considerations in VLSI Circuits,” IEEE Trans. on Computers, vol. C-30, 1981, pp. 135–140.Google Scholar
  19. 19.
    G. Vijayan, “Geometry of Planar Graphs with Angles”, Proc. ACM Symp. on Computational Geometry, 1986, pp. 116–124.Google Scholar
  20. 20.
    G. Vijayan and A. Wigderson, “Rectiliear Graphs and their Embeddings,” SIAM Journal of Computing, Vol. 14, No. 2, May 1985.Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Ashim Garg
    • 1
  1. 1.Department of Computer ScienceBrown UniversityProvidenceUSA

Personalised recommendations