Drawing Planar Graphs of Bounded Degree with Few Slopes

@inproceedings{Keszegh2010DrawingPG,
  title={Drawing Planar Graphs of Bounded Degree with Few Slopes},
  author={Bal{\'a}zs Keszegh and J{\'a}nos Pach and D{\"o}m{\"o}t{\"o}r P{\'a}lv{\"o}lgyi},
  booktitle={Graph Drawing},
  year={2010}
}
We settle a problem of Dujmović, Eppstein, Suderman, and Wood by showing that there exists a function f with the property that every planar graph G with maximum degree d admits a drawing with noncrossing straight-line edges, using at most f(d) different slopes. If we allow the edges to be represented by polygonal paths with one bend, then 2d slopes suffice. Allowing two bends per edge, every planar graph with maximum degree d ≥ 3 can be drawn using segments of at most ⌈d/2⌉ different slopes… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
26 Citations
36 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 26 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 36 references

Szegedy : Geometric representation of cubic graphs with four directions

  • J. Pach, D.
  • Comput . Geom .
  • 2009

Kobourov : The geometric thickness of low degree graphs

  • D. Eppstein, G. S.
  • 2007

Wood : Graph drawings with few slopes

  • M. Suderman V. Dujmović, R. D.
  • Comput . Geom .
  • 2007

Pálvölgyi : Boundeddegree graphs can have arbitrarily large slope numbers , Electronic J

  • J. Pach, G.
  • . Combinatorics
  • 2006

Similar Papers

Loading similar papers…