Graph drawings with few slopes

DOI10.1016/j.comgeo.2006.08.002zbMath1128.65020arXivmath/0606446OpenAlexW1998148652MaRDI QIDQ2385698

David R. Wood, Matthew Suderman, Vida Dujmović

Publication date: 12 October 2007

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0606446

zbMATH Keywords

graph drawingcomplete multipartite graphslopeconvex slope-numberslope-number

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Upward Planar Drawings with Three and More Slopes ⋮ Drawings of planar graphs with few slopes and segments ⋮ Upward planar drawings with three and more slopes ⋮ The planar slope number of planar partial 3-trees of bounded degree ⋮ Universal slope sets for 1-bend planar drawings ⋮ On the Complexity of the Planar Slope Number Problem ⋮ Outerplanar graph drawings with few slopes ⋮ Drawing cubic graphs with at most five slopes ⋮ Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs ⋮ On dispersable book embeddings ⋮ Universal slope sets for upward planar drawings ⋮ Cubic Graphs Have Bounded Slope Parameter ⋮ Level-planar drawings with few slopes ⋮ Level-planar drawings with few slopes ⋮ On tree-partition-width ⋮ A note on isosceles planar graph drawing

Uses Software

• LatDraw

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the minimum number of edge-directions of a convex polytope
• Planar configurations which determine few slopes
• Drawing orders with few slopes
• The complexity of finding uniform emulations on paths and ring networks
• Structure of slope-critical configurations
• Few slopes without collinearity
• 2N noncollinear points determine at least 2N directions
• The asymptotic number of labeled graphs with given degree sequences
• A partial k-arboretum of graphs with bounded treewidth
• Interval degree and bandwidth of a graph
• A note on caterpillar-embeddings with no two parallel edges
• Crooked diagrams with few slopes
• Direction trees
• On the number of directions determined by a three-dimensional points set
• Drawings of planar graphs with few slopes and segments
• Bounded-degree graphs have arbitrarily large geometric thickness
• Bounded-degree graphs can have arbitrarily large slope numbers
• Lattice diagrams with few slopes
• Drawability of Complete Graphs Using a Minimal Slope Set
• Graphs with E Edges Have Pagenumber O(√E)
• Geometric Thickness of Complete Graphs
• PATHWIDTH AND LAYERED DRAWINGS OF TREES
• Some results on tree decomposition of graphs
• Solution of Scott's problem on the number of directions determined by a point set in 3-space
• The geometric thickness of low degree graphs
• On the Sets of Directions Determined by n Points
• Graph Drawing
• Graph Drawing
• Concept Lattices