On Drawing Angle Graphs (Extended Abstract)

Garg, Ashim (1995) On Drawing Angle Graphs (Extended Abstract). In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 84-95 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_359).

Full text not available from this repository.


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.

Item Type:Conference Paper
Additional Information:10.1007/3-540-58950-3_359
Classifications:M Methods > M.999 Others
G Algorithms and Complexity > G.999 Others
M Methods > M.600 Planar
P Styles > P.540 Planar
ID Code:101

Repository Staff Only: item control page


R.F. Cohen, G. Di Battista, R. Tamassia, I.G. Tollis, and P. Bertolazzi, "A Framework for Dynamik Graph Drawing," Proc. ACM Symp. on Computational Geometry, 1992, pp. 261-270.

I.F. Cruz, A. Garg, "Drawing Graphs by Example Effeciently: Trees and Planar Acyclic Digraphs," Graph Drawing '94 (Proc. DIMACS Workshop on Graph Drawing), to appear.

G. Di Battista, P. Eades, R. Tamassia and I.G. Tollis,"Algorithms for Drawing Graphs: An Annotated Bibliography," Comp. Geom. Theory Appl., to appear.

G. Di Battista, R. Tamassia, and I.G. Tollis, "Area Requirement and Symmetry Display of Planar Upward Drawings," Disc. & Comp. Geom., vol. 7, 1992.

G. Di Battista and L. Vismara, "Angles of Planar Triangular Graphs," Proc. ACM Symp. on Theory of Computing, 1993.

P. Eades and T. Lin. "Algorithmic and declarative approaches to aesthetic layout," Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing).

M. Formann, T. Hagerup, J. Haralambides, M. Kaufmann, F.T. Leighton, A. Simvonis, E. Welzl, and G. Woeginger, "Drawing in the Plane with High Resulution," Proc. FOCS, 1990, pp. 86-95.

A. Garg, M.T. Goodrich, and R. Tamassia, "Area-effecient Upward Tree Drawings", Proc. ACM Symp. on Computational Geometry, 1993, pp. 359-368.

A. Garg and R. Tamassia, "Planar Drawings and Angular Resolution: Algorithms and Bounds", European Symposium on Algorithms, 1994.

M.R. Gary and D.S. Johnson, "Computers and Intractability: A Guide to the Theory of N P-Completeness," W.H. Freeman, New York, NY 1979.

M.Himsolt, "A View to Graph Drawing Algorithms Through GraphEd", Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing), Paris, 1993.

T. Kamada. On Visualization of Abstract Objects and Relations. PhD thesis, Department of Information Science, University of Tokyo, 1988.

G. Kant. Drawing planar grapßhs using the lmc-ordering. In Proc. 33th Annu. IEEE Sympos. Found. Comput. Sci., pages 101-110, 1992.

C.E. Leiserson, "Area-Efficient Graph Layouts (for VLSI)," Proc. IEEE Symp. on Foundations of Computer Science, 1980, pp. 270-281.

S.M. Malitz and A. Papakostas, "On the Angular Resolution of Planar Graphs," Proc. ACM Symp. on Theory of Computing. 1992, pp. 527-538.

R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421-444, 1987.

R. Tamassia and I. G. Tollis. A unified approach to visibility representations of planar graphs. Discrete Comput. Geom., 1(4):321-341, 1986.

L. Valiant, "Universality Considerations in VLSI Circuits," IEEE Trans. on Computers, vol. C-30, 1981, pp. 135-140.

G. Vijayan, "Geometry of Planar Graphs with Angles", Proc. ACM Symp. on Computational Geometry, 1986, pp. 116-124.

G. Vijay an and A. Wigderson, "Rectiliear Graphs and their Embeddings," SIAM Journal of Computing, Vol.14, No. 2, May 1985.