Extending Partial Orthogonal Drawings

We study the planar orthogonal drawing style within the framework of partial representation extension. Let $(G,H,{\Gamma}_H )$ be a partial orthogonal drawing, i.e., G is a graph, $H\subseteq G$ is a subgraph and ${\Gamma}_H$ is a planar orthogonal drawing of H. We show that the existence of an orthogonal drawing ${\Gamma}_G$ of $G$ that extends ${\Gamma}_H$ can be tested in linear time. If such a drawing exists, then there also is one that uses $O(|V(H)|)$ bends per edge. On the other hand, we show that it is NP-complete to find an extension that minimizes the number of bends or has a fixed number of bends per edge.

[1]  Ignaz Rutter,et al.  Optimal Orthogonal Graph Drawing with Convex Bend Costs , 2012, ACM Trans. Algorithms.

[2]  Yota Otachi,et al.  Extending Partial Representations of Interval Graphs , 2011, Algorithmica.

[3]  Mark de Berg,et al.  Optimal Binary Space Partitions for Segments in the Plane , 2012, Int. J. Comput. Geom. Appl..

[4]  Michael Kaufmann,et al.  Drawing High Degree Graphs with Low Bend Numbers , 1995, GD.

[5]  Walter Didimo,et al.  Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time , 2019, SODA.

[6]  Yota Otachi,et al.  Extending Partial Representations of Subclasses of Chordal Graphs , 2012, ISAAC.

[7]  Giuseppe Liotta,et al.  Spirality and Optimal Orthogonal Drawings , 1998, SIAM J. Comput..

[8]  Ignaz Rutter,et al.  Orthogonal graph drawing with inflexible edges , 2016, Comput. Geom..

[9]  Robert Ganian,et al.  Extending Partial 1-Planar Drawings , 2020, ICALP.

[10]  Maurizio Patrignani.  On Extending a Partial Straight-Line Drawing , 2005, Graph Drawing.

[11]  Jan Kratochvíl,et al.  A Kuratowski-type theorem for planarity of partially embedded graphs , 2013, Comput. Geom..

[12]  Walter Didimo,et al.  Computing Orthogonal Drawings in a Variable Embedding Setting , 1998, ISAAC.

[13]  Roberto Tamassia,et al.  On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..

[14]  János Pach,et al.  Embedding Planar Graphs at Fixed Vertex Locations , 1998, GD.

[15]  Pavel Klavík,et al.  Extending Partial Representations of Circle Graphs , 2013, Graph Drawing.

[16]  Roberto Tamassia,et al.  On the Computational Complexity of Upward and Rectilinear Planarity Testing , 1994, SIAM J. Comput..

[17]  Donald E. Knuth,et al.  The Problem of Compatible Representatives , 1992, SIAM J. Discret. Math..

[18]  Timothy M. Chan,et al.  Drawing Partially Embedded and Simultaneously Planar Graphs , 2015, J. Graph Algorithms Appl..

[19]  Jan Kratochvíl,et al.  A kuratowski-type theorem for planarity of partially embedded graphs , 2011, SoCG '11.

[20]  Yota Otachi,et al.  Extending partial representations of subclasses of chordal graphs , 2015, Theor. Comput. Sci..

[21]  Jan Kratochvíl,et al.  Testing planarity of partially embedded graphs , 2010, SODA '10.

[22]  Yota Otachi,et al.  Extending Partial Representations of Proper and Unit Interval Graphs , 2016, Algorithmica.

[23]  Michael T. Goodrich,et al.  Planar Orthogonal and Polyline Drawing Algorithms , 2013, Handbook of Graph Drawing and Visualization.

[24]  Jan Kratochvíl,et al.  Simultaneous Orthogonal Planarity , 2016, Graph Drawing.

[25]  David Eppstein,et al.  Graph-Theoretic Solutions to Computational Geometry Problems , 2009, WG.

[26]  Bartosz Walczak,et al.  Extending Partial Representations of Trapezoid Graphs , 2017, WG.

[27]  Yota Otachi,et al.  Extending Partial Representations of Proper and Unit Interval Graphs , 2012, Algorithmica.

[28]  Paul Dorbec,et al.  Contact Representations of Planar Graphs: Extending a Partial Representation is Hard , 2014, WG.