20 search results - page 4 / 4 » An Algorithm for Three-Dimensional Orthogonal Graph Drawing |
VLC
2002
13 years 10 months ago
2002
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising orthogonality). Determining the extent to which a grap...
DCG
2008
13 years 11 months ago
2008
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
COMGEO
2004
ACM
13 years 10 months ago
2004
ACM
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...
SOFTVIS
2003
ACM
14 years 4 months ago
2003
ACM
UML diagrams have become increasingly important in the engineering and reengineering processes for software systems. Of particular interest are UML class diagrams whose purpose is...