10 research outputs found

    Synchronized planarity with applications to constrained planarity problems

    Get PDF
    We introduce the problem Synchronized Planarity. Roughly speaking, its input is a loop-free multi-graph together with synchronization constraints that, e.g., match pairs of vertices of equal degree by providing a bijection between their edges. Synchronized Planarity then asks whether the graph admits a crossing-free embedding into the plane such that the orders of edges around synchronized vertices are consistent. We show, on the one hand, that Synchronized Planarity can be solved in quadratic time, and, on the other hand, that it serves as a powerful modeling language that lets us easily formulate several constrained planarity problems as instances of Synchronized Planarity. In particular, this lets us solve Clustered Planarity in quadratic time, where the most efficient previously known algorithm has an upper bound of O(n⁞)

    Computing NodeTrix Representations of Clustered Graphs

    Full text link
    NodeTrix representations are a popular way to visualize clustered graphs; they represent clusters as adjacency matrices and inter-cluster edges as curves connecting the matrix boundaries. We study the complexity of constructing NodeTrix representations focusing on planarity testing problems, and we show several NP-completeness results and some polynomial-time algorithms. Building on such algorithms we develop a JavaScript library for NodeTrix representations aimed at reducing the crossings between edges incident to the same matrix.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016

    Planarity Testing and Optimal Edge Insertion with Embedding Constraints

    No full text

    Planarity testing and optimal edge insertion with embedding constraints

    No full text
    The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-of-the-art planar drawing algorithms. However, many practical applications have additional constraints on the drawings that result in restrictions on the set of admissible planar embeddings. In this paper, we consider embedding constraints that restrict the admissible order of incident edges around a vertex. Such constraints occur in applications, e.g., from side or port constraints. We introduce a set of hierarchical embedding constraints that include grouping, oriented, and mirror constraints, and show how these constraints can be integrated into the planarization method. For this, we first present a linear time algorithm for testing if a given graph G is ec-planar, i.e., admits a planar embedding satisfying the given embedding constraints. In the case that G is ec-planar, we provide a linear time algorithm for computing the corresponding ec-embedding. Otherwise, an ec-planar subgraph is computed. The critical part is to re-insert the deleted edges subject to the embedding constraints so that the number of crossings is kept small. For this, we present a linear time algorithm which is able to insert an edge into an ec-planar graph H so that the insertion is crossing minimal among all ec-planar embeddings of H. As a side result, we characterize the set of all possible ec-planar embeddings using BC- and SPQR-trees

    Geometric Graph Drawing Algorithms - Theory, Engineering and Experiments

    Get PDF

    The many faces of planarity : matching, augmentation, and embedding algorithms for planar graphs

    Get PDF

    Planare Graphen und ihre Dualgraphen auf ZylinderoberflÀchen

    Get PDF
    In this thesis, we investigates plane drawings of undirected and directed graphs on cylinder surfaces. In the case of undirected graphs, the vertices are positioned on a line that is parallel to the cylinder’s axis and the edge curves must not intersect this line. We show that a plane drawing is possible if and only if the graph is a double-ended queue (deque) graph, i. e., the vertices of the graph can be processed according to a linear order and the edges correspond to items in the deque inserted and removed at their end vertices. A surprising consequence resulting from these observations is that the deque characterizes planar graphs with a Hamiltonian path. This result extends the known characterization of planar graphs with a Hamiltonian cycle by two stacks. By these insights, we also obtain a new characterization of queue graphs and their duals. We also consider the complexity of deciding whether a graph is a deque graph and prove that it is NP-complete. By introducing a split operation, we obtain the splittable deque and show that it characterizes planarity. For the proof, we devise an algorithm that uses the splittable deque to test whether a rotation system is planar. In the case of directed graphs, we study upward plane drawings where the edge curves follow the direction of the cylinder’s axis (standing upward planarity; SUP) or they wind around the axis (rolling upward planarity; RUP). We characterize RUP graphs by means of their duals and show that RUP and SUP swap their roles when considering a graph and its dual. There is a physical interpretation underlying this characterization: A SUP graph is to its RUP dual graph as electric current passing through a conductor to the magnetic field surrounding the conductor. Whereas testing whether a graph is RUP is NP-hard in general [Bra14], for directed graphs without sources and sink, we develop a linear-time recognition algorithm that is based on our dual graph characterization of RUP graphs.Die Arbeit beschĂ€ftigt sich mit planaren Zeichnungen ungerichteter und gerichteter Graphen auf ZylinderoberflĂ€chen. Im ungerichteten Fall werden Zeichnungen betrachtet, bei denen die Knoten auf einer Linie parallel zur Zylinderachse positioniert werden und die Kanten diese Linie nicht schneiden dĂŒrfen. Es kann gezeigt werden, dass eine planare Zeichnung genau dann möglich ist, wenn die Kanten des Graphen in einer double-ended queue (Deque) verarbeitet werden können. Ebenso lassen sich dadurch Queue, Stack und Doppelstack charakterisieren. Eine ĂŒberraschende Konsequenz aus diesen Erkenntnissen ist, dass die Deque genau die planaren Graphen mit Hamiltonpfad charakterisiert. Dies erweitert die bereits bekannte Charakterisierung planarer Graphen mit Hamiltonkreis durch den Doppelstack. Im gerichteten Fall mĂŒssen die Kantenkurven entweder in Richtung der Zylinderachse verlaufen (SUP-Graphen) oder sich um die Achse herumbewegen (RUP-Graphen). Die Arbeit charakterisiert RUP-Graphen und zeigt, dass RUP und SUP ihre Rollen tauschen, wenn man Graph und Dualgraph betrachtet. Der SUP-Graph verhĂ€lt sich dabei zum RUP-Graphen wie elektrischer Strom durch einen Leiter zum induzierten Magnetfeld. Ausgehend von dieser Charakterisierung ist es möglich einen Linearzeit-Algorithmus zu entwickeln, der entscheidet ob ein gerichteter Graph ohne Quellen und Senken ein RUP-Graph ist, wĂ€hrend der allgemeine Fall NP-hart ist [Bra14]
    corecore