Drawing Stressed Planar Graphs in Three Dimensions

Eades, Peter and Garvan, Patrick (1996) Drawing Stressed Planar Graphs in Three Dimensions. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 212-223(Official URL: http://dx.doi.org/10.1007/BFb0021805).

Full text not available from this repository.


There is much current interest among researches to find algorithms that will draw graphs in three dimensions. It is well known that every 3-connected planar graph can be represented as a strictly convex polyhedron. However, no practical algorithms exist to draw a general 3-connected planar graph as a convex polyhedron. In this paper we review the concept of a stressed graph and how it relates to convex polyhedra; we present a practical algorithm that uses stressed graphs to draw 3-connected planar graphs as strictly convex polyhedra; and show some examples.

Item Type: Conference Paper
Additional Information: 10.1007/BFb0021805
Classifications: P Styles > P.720 Straight-line
P Styles > P.060 3D
URI: http://gdea.informatik.uni-koeln.de/id/eprint/128

Actions (login required)

View Item View Item