## Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments

- Alexander Igamberdiev, Wouter Meulemans, André Schulz
- J. Graph Algorithms Appl.
- 2017

Highly Influenced

6 Excerpts

@inproceedings{Biswas2010MinimumSegmentCD, title={Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs}, author={Sudip Biswas and Debajyoti Mondal and Rahnuma Islam Nishat and Md. Saidur Rahman}, booktitle={COCOON}, year={2010} }

- Published in COCOON 2010
DOI:10.1007/978-3-642-14031-0_21

A convex drawing of a plane graph G is a plane drawing of G, where each vertex is drawn as a point, each edge is drawn as a straight line segment and each face is drawn as a convex polygon. A maximal segment is a drawing of a maximal set of edges that form a straight line segment. A minimum-segment convex drawing of G is a convex drawing of G where the number of maximal segments is the minimum among all possible convex drawings of G. In this paper, we present a lineartime algorithm to obtain a… CONTINUE READING