32 search results - page 5 / 7 » Refinement of Orthogonal Graph Drawings |
GD
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. The need for a similarity measure for comparing two drawings of graphs arises in problems such as interactive graph drawing and the indexing or browsing of large sets of ...
DCG
2008
13 years 7 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...
VLC
2002
13 years 7 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...
COMGEO
2004
ACM
13 years 7 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...
SOFSEM
2005
Springer
14 years 1 months ago
2005
Springer
d Abstract) Lubomir Torok Institute of Mathematics and Computer Science Slovak Academy of Sciences Severna 5, 974 01 Banska Bystrica, Slovak Republic 3-dimensional layout of graph...