Untangling Circular Drawings: Algorithms and Complexity

11/18/2021
by   Sujoy Bhore, et al.
0

We consider the problem of untangling a given (non-planar) straight-line circular drawing δ_G of an outerplanar graph G=(V, E) into a planar straight-line circular drawing by shifting a minimum number of vertices to a new position on the circle. For an outerplanar graph G, it is clear that such a crossing-free circular drawing always exists and we define the circular shifting number shift(δ_G) as the minimum number of vertices that are required to be shifted in order to resolve all crossings of δ_G. We show that the problem Circular Untangling, asking whether shift(δ_G) ≤ K for a given integer K, is NP-complete. For n-vertex outerplanar graphs, we obtain a tight upper bound of shift(δ_G) ≤ n - ⌊√(n-2)⌋ -2. Based on these results we study Circular Untangling for almost-planar circular drawings, in which a single edge is involved in all the crossings. In this case, we provide a tight upper bound shift(δ_G) ≤⌊n/2⌋-1 and present a constructive polynomial-time algorithm to compute the circular shifting number of almost-planar drawings.

READ FULL TEXT

page 3

page 7

page 10

page 11

page 15

page 16

page 17

page 19

research
07/08/2021

Angles of Arc-Polygons and Lombardi Drawings of Cacti

We characterize the triples of interior angles that are possible in non-...
research
03/26/2019

Testing isomorphism of circular-arc graphs in polynomial time

A graph is said to be circular-arc if the vertices can be associated wit...
research
06/12/2018

Circular-shift Linear Network Codes with Arbitrary Odd Block Lengths

Circular-shift linear network coding (LNC) is a special type of vector L...
research
03/02/2020

Tightening Curves on Surfaces Monotonically with Applications

We prove the first polynomial bound on the number of monotonic homotopy ...
research
10/30/2017

An algorithmic approach to handle circular trading in commercial taxing system

Tax manipulation comes in a variety of forms with different motivations ...
research
10/26/2014

On Chord and Sagitta in Z^2: An Analysis towards Fast and Robust Circular Arc Detection

Although chord and sagitta, when considered in tandem, may reflect many ...
research
09/20/2017

Drawing Graphs on Few Circles and Few Spheres

Given a drawing of a graph, its visual complexity is defined as the numb...

Please sign up or login with your details

Forgot password? Click here to reset