11 search results - page 2 / 3 » Characterizing 3-connected planar graphs and graphic matroid... |
GD
2007
Springer
13 years 11 months ago
2007
Springer
GD
2004
Springer
13 years 10 months ago
2004
Springer
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, a...
DCG
2011
13 years 6 days ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
GD
2006
Springer
13 years 9 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
GD
2004
Springer
13 years 10 months ago
2004
Springer
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...