40 search results - page 4 / 8 » Area Requirements for Drawing Hierarchically Planar Graphs |
ENDM
2008
13 years 5 months ago
2008
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend. The morph uses a polynomial number of elementary steps, whe...
SOFSEM
2007
Springer
13 years 12 months ago
2007
Springer
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...
CCCG
2007
13 years 7 months ago
2007
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend during the course of the morph. The morph uses a polynomial ...
COMGEO
2004
ACM
13 years 5 months ago
2004
ACM
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
ESA
1993
Springer
13 years 9 months ago
1993
Springer
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward ...