Pointed drawings of planar graphs☆

We study the problem how to draw a planar graph crossing-free such that every vertex is incident to an angle greater than π. In general a plane straight-line drawing cannot guarantee this property. We present algorithms which construct such drawings with either tangent-continuous biarcs or quadratic Bézier curves (parabolic arcs), even if the positions of the vertices are predefined by a given plane straight-line drawing of the graph. Moreover, the graph can be drawn with circular arcs if the vertices can be placed arbitrarily. The topic is related to non-crossing drawings of multigraphs and vertex labeling.

[1]  H. Whitney.  A Set of Topological Invariants for Graphs , 1933 .

[2]  G. Panina.  On hyperbolic virtual polytopes and hyperbolic fans , 2006 .

[3]  E. M. Andreev.  ON CONVEX POLYHEDRA IN LOBAČEVSKIĬ SPACES , 1970 .

[4]  P. Hall.  On Representatives of Subsets , 1935 .

[5]  János Pach,et al.  Combinatorial Geometry , 2012 .

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

[7]  J. Pach,et al.  Combinatorial geometry , 1995, Wiley-Interscience series in discrete mathematics and optimization.

[8]  Kenneth Stephenson,et al.  A circle packing algorithm , 2003, Comput. Geom..

[9]  Ileana Streinu,et al.  Acute Triangulations of Polygons , 2005, Discret. Comput. Geom..

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

[11]  Francisco Santos,et al.  Pseudo-Triangulations - a Survey , 2006 .

[12]  W. Thurston.  The geometry and topology of 3-manifolds , 1979 .

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

[14]  Y. C. Verdière.  Un principe variationnel pour les empilements de cercles , 1991 .

[15]  Michel Pocchiola,et al.  The visibility complex , 1993, SCG '93.

[16]  G. Panina.  New counterexamples to A. D. Alexandrov's hypothesis , 2005 .

[17]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[18]  Bojan Mohar,et al.  A polynomial time circle packing algorithm , 1993, Discret. Math..

[19]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[20]  Michel Pocchiola,et al.  Pseudo-triangulations: theory and applications , 1996, SCG '96.

[21]  Günter Rote.  Strictly convex drawings of planar graphs , 2005, SODA.

[22]  Ileana Streinu,et al.  A combinatorial approach to planar non-colliding robot arm motion planning , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[23]  Günter Rote,et al.  Planar minimally rigid graphs and pseudo-triangulations , 2003, SCG '03.

[24]  G. Laman.  On graphs and rigidity of plane skeletal structures , 1970 .

[25]  Francisco Santos,et al.  Combinatorial pseudo-triangulations , 2007, Discret. Math..