2,608 research outputs found

### NodeTrix Planarity Testing with Small Clusters

We study the NodeTrix planarity testing problem for flat clustered graphs
when the maximum size of each cluster is bounded by a constant $k$. We consider
both the case when the sides of the matrices to which the edges are incident
are fixed and the case when they can be chosen arbitrarily. We show that
NodeTrix planarity testing with fixed sides can be solved in
$O(k^{3k+\frac{3}{2}} \cdot n)$ time for every flat clustered graph that can be
reduced to a partial 2-tree by collapsing its clusters into single vertices. In
the general case, NodeTrix planarity testing with fixed sides can be solved in
$O(n)$ time for $k = 2$, but it is NP-complete for any $k > 2$. NodeTrix
planarity testing remains NP-complete also in the free sides model when $k >
4$.Comment: Appears in the Proceedings of the 25th International Symposium on
Graph Drawing and Network Visualization (GD 2017

### On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity

Computing planar orthogonal drawings with the minimum number of bends is one
of the most relevant topics in Graph Drawing. The problem is known to be
NP-hard, even when we want to test the existence of a rectilinear planar
drawing, i.e., an orthogonal drawing without bends (Garg and Tamassia, 2001).
From the parameterized complexity perspective, the problem is fixed-parameter
tractable when parameterized by the sum of three parameters: the number of
bends, the number of vertices of degree at most two, and the treewidth of the
input graph (Di Giacomo et al., 2022). We improve this last result by showing
that the problem remains fixed-parameter tractable when parameterized only by
the number of vertices of degree at most two plus the number of bends. As a
consequence, rectilinear planarity testing lies in \FPT~parameterized by the
number of vertices of degree at most two.Comment: Appears in the Proceedings of the 31st International Symposium on
Graph Drawing and Network Visualization (GD 2023

### Hamiltonian orthogeodesic alternating paths

AbstractLet R be a set of red points and let B be a set of blue points. The point set P=RâˆªB is called equitable if ||B|âˆ’|R||â©½1 and it is called general if no two points are vertically or horizontally aligned. An orthogeodesic alternating path on P is a path such that each edge is an orthogeodesic chain connecting points of different color and such that no two edges cross. We consider the problem of deciding whether a set of red and blue points admits a Hamiltonian orthogeodesic alternating path, that is, an orthogeodesic alternating path visiting all points. We prove that every general equitable point set admits a Hamiltonian orthogeodesic alternating path and we present an O(nlog2n)-time algorithm for finding such a path, where n is the number of points. On the other hand, we show that the problem is NP-complete if the path must be on the grid (i.e., vertices and bends have integer coordinates). Further, we show that we can approximate the maximum length of an orthogeodesic alternating path on the grid by a factor of 3, whereas we present a family of point sets with n points that do not have a Hamiltonian orthogeodesic alternating path with more than n/2+2 points. Additionally, we show that it is NP-complete to decide whether a given set of red and blue points on the grid admits an orthogeodesic perfect matching if horizontally aligned points are allowed. This contrasts a recent result by Kano (2009) [9] who showed that this is possible on every general point set

### Polyline Drawings with Topological Constraints

Let G be a simple topological graph and let Gamma be a polyline drawing of G. We say that Gamma partially preserves the topology of G if it has the same external boundary, the same rotation system, and the same set of crossings as G. Drawing Gamma fully preserves the topology of G if the planarization of G and the planarization of Gamma have the same planar embedding. We show that if the set of crossing-free edges of G forms a connected spanning subgraph, then G admits a polyline drawing that partially preserves its topology and that has curve complexity at most three (i.e., at most three bends per edge). If, however, the set of crossing-free edges of G is not a connected spanning subgraph, the curve complexity may be Omega(sqrt{n}). Concerning drawings that fully preserve the topology, we show that if G has skewness k, it admits one such drawing with curve complexity at most 2k; for skewness-1 graphs, the curve complexity can be reduced to one, which is a tight bound. We also consider optimal 2-plane graphs and discuss trade-offs between curve complexity and crossing angle resolution of drawings that fully preserve the topology

- â€¦