29 search results - page 2 / 6 » Convex drawings of hierarchical planar graphs and clustered ... |
COMGEO
2004
ACM
13 years 4 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...
COCOON
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
GD
1999
Springer
13 years 9 months ago
1999
Springer
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
GD
1997
Springer
13 years 9 months ago
1997
Springer
d Abstract) In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex ...
GD
2003
Springer
13 years 10 months ago
2003
Springer
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morph...