Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

GD
2004
Springer

favoriteEmaildiscussreport

91views Computer Graphics» more GD 2004»

Really Straight Graph Drawings

13 years 10 months ago

Really Straight Graph Drawings

Download www.ms.unimelb.edu.au

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, and planar 3-trees. We prove that every 3-connected plane graph on n vertices has a plane drawing with at most 5n/2 segments and at most 2n slopes, and that every cubic 3-connected plane graph has a plane drawing with three slopes (and three bends on the outerface). Drawings of non-planar graphs with few slopes are also considered. For example, it is proved that graphs of bounded degree and bounded treewidth have drawings with O(log n) slopes.

Vida Dujmovic, Matthew Suderman, David R. Wood

Real-time Traffic

3-connected Plane Graph | Cubic 3-connected Plane | GD 2004 | Straight-line Drawings |

claim paper

Related Content

» Minimizing the Area for Planar StraightLine Grid Drawings

» StraightLine Drawing Algorithms for Hierarchical Graphs and Clustered Graphs

» Outerplanar Crossing Numbers of 3Row Meshes Halin Graphs and Complete pPartite Graphs

» ThreeDimensional Grid Drawings with Subquadratic Volume

» Obfuscated Drawings of Planar Graphs

» Morphing Planar Graph Drawings with Bent Edges

» Morphing Planar Graph Drawings

» On the Parameterized Complexity of Layered Graph Drawing

» Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	GD
Authors	Vida Dujmovic, Matthew Suderman, David R. Wood

Comments (0)