A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners

A star-shaped drawing 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, we consider the problem of finding a star-shaped drawing of a biconnected planar graph with the minimum number of concave corners. We first show new structural properties of planar graphs to derive a lower bound on the number of concave corners. Based on the lower bound, we prove that the problem can be solved in linear time by presenting a linear-time algorithm for finding a best plane embedding of a biconnected planar graph with the minimum number of concave corners. This is in spite of the fact that a biconnected planar graph may have an exponential number of different plane embeddings.

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

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

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

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

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

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

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

[8]  Hiroshi Nagamochi,et al.  An algorithm for constructing star-shaped drawings of plane graphs , 2010, Comput. Geom..

[9]  Michael Kaufmann,et al.  Drawing graphs: methods and models , 2001 .

[10]  V. Bryant,et al.  Straight line representations of planar graphs. , 1989 .

[11]  Takao Nishizeki,et al.  Convex Drawings of Plane Graphs of Minimum Outer Apices , 2006, Int. J. Found. Comput. Sci..

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

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

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

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

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

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

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

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

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