An algorithm for constructing star-shaped drawings of plane graphs

A straight-line planar drawing of a plane graph is called a convex drawing if every facial cycle is drawn as a convex polygon. Convex drawings of graphs is a well-established aesthetic in graph drawing, however not all planar graphs admit a convex drawing. Tutte [W.T. Tutte, Convex representations of graphs, Proc. of London Math. Soc. 10 (3) (1960) 304-320] showed that every triconnected plane graph admits a convex drawing for any given boundary drawn as a convex polygon. Thomassen [C. Thomassen, Plane representations of graphs, in: Progress in Graph Theory, Academic Press, 1984, pp. 43-69] gave a necessary and sufficient condition for a biconnected plane graph with a prescribed convex boundary to have a convex drawing. In this paper, we initiate a new notion of star-shaped drawing of a plane graph as a straight-line planar 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. A star-shaped drawing is a natural extension of a convex drawing, and a new aesthetic criteria for drawing planar graphs in a convex way as much as possible. We give a sufficient condition for a given set A of corners of a plane graph to admit a star-shaped drawing whose concave corners are given by the corners in A, and present a linear time algorithm for constructing such a star-shaped drawing.

[1]  J. A. Bondy,et al.  Progress in Graph Theory , 1984 .

[2]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[3]  Takao Nishizeki,et al.  Convex Drawings of Plane Graphs of Minimum Outer Apices , 2005, Graph Drawing.

[4]  W. T. Tutte.  Graph Theory , 1984 .

[5]  Marek Chrobak,et al.  Convex drawings of graphs in two and three dimensions (preliminary version) , 1996, SCG '96.

[6]  In-kyeong Choi.  On straight line representations of random planar graphs , 1992 .

[7]  Stefan Felsner,et al.  Convex Drawings of 3-Connected Plane Graphs , 2004, SODA '05.

[8]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[9]  TamassiaRoberto,et al.  On-Line Planarity Testing , 1996 .

[10]  Petra Mutzel,et al.  A Linear Time Implementation of SPQR-Trees , 2000, GD.

[11]  Hiroshi Nagamochi,et al.  Convex Drawings of Graphs with Non-convex Boundary , 2006, WG.

[12]  Hiroshi Nagamochi,et al.  Convex drawings of hierarchical planar graphs and clustered planar graphs , 2010, J. Discrete Algorithms.

[13]  Shin-Ichi Nakano,et al.  Convex Grid Drawings of Four-connected Plane Graphs , 2006, Int. J. Found. Comput. Sci..

[14]  Md. Saidur Rahman,et al.  Planar Graph Drawing , 2004, Lecture Notes Series on Computing.

[15]  Hiroshi Nagamochi,et al.  Convex drawings of graphs with non-convex boundary constraints , 2006, Discret. Appl. Math..

[16]  Roberto Tamassia,et al.  On-Line Planarity Testing , 1989, SIAM J. Comput..

[17]  Kozo Sugiyama.  Graph Drawing and Applications for Software and Knowledge Engineers , 2002, Series on Software Engineering and Knowledge Engineering.

[18]  K. Wagner.  Bemerkungen zum Vierfarbenproblem. , 1936 .

[19]  W. T. Tutte.  Convex Representations of Graphs , 1960 .

[20]  M. Chrobak,et al.  Convex Grid Drawings of 3-Connected Planar Graphs , 1997, Int. J. Comput. Geom. Appl..

[21]  Hiroshi Nagamochi,et al.  A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners , 2011, Algorithmica.

[22]  Hiroshi Nagamochi,et al.  Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints , 2008, COCOON.

[23]  G. Kant.  Algorithms for drawing planar graphs , 1993 .