A star-shapeddrawing of a graph is a straight-line drawing such that each inner facial cycle is drawn as a star-shaped polygon, and the outer facial cycle is drawn as a convex polygon. In this paper, given a biconnected planar graph Gwith fixed plane embedding and a subset Aof corners of G, we consider the problem of finding a star-shaped drawing Dof Gsuch that only corners in Aare allowed to become concave corners in D. We first characterize a necessary and sufficient condition for a subset Aof corners to admit such a star-shaped drawing D. Then we present a linear time algorithm for finding such a star-shaped drawing D. Our characterization includes Thomassen's classical characterization of biconnected plane graphs with a prescribed boundary that have convex drawings.
[1]
G. Kant.
Algorithms for drawing planar graphs
,
1993
.
[2]
Roberto Tamassia,et al.
On-Line Planarity Testing
,
1989,
SIAM J. Comput..
[3]
J. A. Bondy,et al.
Progress in Graph Theory
,
1984
.
[4]
Takao Nishizeki,et al.
Convex Drawings of Plane Graphs of Minimum Outer Apices
,
2006,
Int. J. Found. Comput. Sci..
[5]
TamassiaRoberto,et al.
On-Line Planarity Testing
,
1996
.
[6]
W. T. Tutte.
Convex Representations of Graphs
,
1960
.
[7]
Hiroshi Nagamochi,et al.
Convex Drawings of Graphs with Non-convex Boundary
,
2006,
WG.