Minimum-segment convex drawings of 3-connected cubic plane graphs

@article{Mondal2013MinimumsegmentCD,
  title={Minimum-segment convex drawings of 3-connected cubic plane graphs},
  author={Debajyoti Mondal and Rahnuma Islam Nishat and Sudip Biswas and Md. Saidur Rahman},
  journal={J. Comb. Optim.},
  year={2013},
  volume={25},
  pages={460-480}
}
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

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
0 Extracted Citations
13 Extracted References
Similar Papers