Planar and Poly-Arc Lombardi Drawings

In Lombardi drawings of graphs, edges are represented as circular arcs and the edges incident on vertices have perfect angular resolution. It is known that not every planar graph has a planar Lombardi drawing. We give an example of a planar 3-tree that has no planar Lombardi drawing and we show that all outerpaths do have a planar Lombardi drawing. Further, we show that there are graphs that do not even have any Lombardi drawing at all. With this in mind, we generalize the notion of Lombardi drawings to that of (smooth) $k$-Lombardi drawings, in which each edge may be drawn as a (differentiable) sequence of $k$ circular arcs; we show that every graph has a smooth $2$-Lombardi drawing and every planar graph has a smooth planar $3$-Lombardi drawing. We further investigate related topics connecting planarity and Lombardi drawings.

[1]  David Eppstein,et al.  Delta-Confluent Drawings , 2005, Graph Drawing.

[2]  Nicolaos Matsakis.  Transforming a random graph drawing into a Lombardi drawing , 2010, ArXiv.

[3]  Petra Mutzel,et al.  Planar Polyline Drawings with Good Angular Resolution , 1998, GD.

[4]  Maarten Löffler,et al.  Planar Lombardi Drawings of Outerpaths , 2012, Graph Drawing.

[5]  Seth M. Malitz,et al.  On the angular resolution of planar graphs , 1992, STOC '92.

[6]  Christophe Hurter,et al.  State of the Art in Edge and Trail Bundling Techniques , 2017, Comput. Graph. Forum.

[7]  David Eppstein,et al.  Journal of Graph Algorithms and Applications Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way , 2022 .

[8]  Goos Kant,et al.  Drawing planar graphs using the canonical ordering , 1996, Algorithmica.

[9]  Michael A. Bekos,et al.  Smooth Orthogonal Layouts , 2012, Graph Drawing.

[10]  J. S. Andrade,et al.  Apollonian networks: simultaneously scale-free, small world, euclidean, space filling, and with matching graphs. , 2004, Physical review letters.

[11]  W. Marsden.  I and J , 2012 .

[12]  Giuseppe Di Battista,et al.  Angles of planar triangular graphs , 1993, STOC '93.

[13]  Stephen G. Kobourov,et al.  On the Usability of Lombardi Graph Drawings , 2012, Graph Drawing.

[14]  Jarke J. van Wijk,et al.  Force‐Directed Edge Bundling for Graph Visualization , 2009, Comput. Graph. Forum.

[15]  Roberto Tamassia,et al.  Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract) , 1994, ESA.

[16]  Michael A. Bekos,et al.  On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings , 2017, Graph Drawing.

[17]  Douglas N. Arnold,et al.  Möbius transformations revealed , 2008 .

[18]  David Eppstein,et al.  Optimal 3D Angular Resolution for Low-Degree Graphs , 2013, J. Graph Algorithms Appl..

[19]  David Eppstein,et al.  Planar and Poly-arc Lombardi Drawings , 2011, Graph Drawing.

[20]  David Eppstein,et al.  Confluent Layered Drawings , 2006, Algorithmica.

[21]  Michael T. Goodrich,et al.  Drawing planar graphs with circular arcs , 1999, GD.

[22]  Ulrik Brandes,et al.  Using Graph Layout to Visualize Train Interconnection Data , 1998, Graph Drawing.

[23]  David Eppstein,et al.  A Möbius-Invariant Power Diagram and Its Applications to Soap Bubbles and Planar Lombardi Drawing , 2014, Discrete & Computational Geometry.

[24]  Roberto Tamassia,et al.  Curvilinear Graph Drawing Using the Force-Directed Method , 2004, GD.

[25]  David Eppstein,et al.  Drawing Trees with Perfect Angular Resolution and Polynomial Area , 2013, Discret. Comput. Geom..

[26]  David Eppstein,et al.  Lombardi Drawings of Graphs , 2010, J. Graph Algorithms Appl..

[27]  David Eppstein,et al.  Simple Recognition of Halin Graphs and Their Generalizations , 2015, J. Graph Algorithms Appl..

[28]  Michael T. Goodrich,et al.  Force-Directed Lombardi-Style Graph Drawing , 2011, Graph Drawing.

[29]  Michael A. Bekos,et al.  Perfect smooth orthogonal drawings , 2014, IISA 2014, The 5th International Conference on Information, Intelligence, Systems and Applications.

[30]  Stephen G. Kobourov,et al.  Fixed-Location Circular Arc Drawing of Planar Graphs , 2007, J. Graph Algorithms Appl..

[31]  Michael Hirsch,et al.  Biclique Edge Cover Graphs and Confluent Drawings , 2006, Graph Drawing.

[32]  Michael T. Goodrich,et al.  A Framework for Drawing Planar Graphs with Curves and Polylines , 1998, Graph Drawing.

[33]  Peter J. Passmore,et al.  A User Study on Curved Edges in Graph Visualization , 2012, IEEE Transactions on Visualization and Computer Graphics.

[34]  Franz Aurenhammer,et al.  Arc Triangulations , 2009 .

[35]  Henry Been-Lirn Duh,et al.  Effects of curves on graph perception , 2016, 2016 IEEE Pacific Visualization Symposium (PacificVis).