Tightening Curves on Surfaces Monotonically with Applications

by   Hsien-Chih Chang, et al.

We prove the first polynomial bound on the number of monotonic homotopy moves required to tighten a collection of closed curves on any compact orientable surface, where the number of crossings in the curve is not allowed to increase at any time during the process. The best known upper bound before was exponential, which can be obtained by combining the algorithm of de Graaf and Schrijver [J. Comb. Theory Ser. B, 1997] together with an exponential upper bound on the number of possible surface maps. To obtain the new upper bound we apply tools from hyperbolic geometry, as well as operations in graph drawing algorithms—the cluster and pipe expansions—to the study of curves on surfaces. As corollaries, we present two efficient algorithms for curves and graphs on surfaces. First, we provide a polynomial-time algorithm to convert any given multicurve on a surface into minimal position. Such an algorithm only existed for single closed curves, and it is known that previous techniques do not generalize to the multicurve case. Second, we provide a polynomial-time algorithm to reduce any k-terminal plane graph (and more generally, surface graph) using degree-1 reductions, series-parallel reductions, and Δ Y-transformations for arbitrary integer k. Previous algorithms only existed in the planar setting when k ≤ 4, and all of them rely on extensive case-by-case analysis based on different values of k. Our algorithm makes use of the connection between electrical transformations and homotopy moves, and thus solves the problem in a unified fashion.



There are no comments yet.


page 13

page 16

page 21

page 25

page 28

page 29

page 30

page 31


Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries

In this paper we prove that the problem of deciding contractibility of a...

Minimum-cost integer circulations in given homology classes

Let D be a directed graph cellularly embedded on a surface together with...

Untangling Circular Drawings: Algorithms and Complexity

We consider the problem of untangling a given (non-planar) straight-line...

Fast and Simple Methods For Computing Control Points

The purpose of this paper is to present simple and fast methods for comp...

On the Complexity of the k-Level in Arrangements of Pseudoplanes

A classical open problem in combinatorial geometry is to obtain tight as...

Plantinga-Vegter algorithm takes average polynomial time

We exhibit a condition-based analysis of the adaptive subdivision algori...

Reconstructing a Polyhedron between Polygons in Parallel Slices

Given two n-vertex polygons, P=(p_1, …, p_n) lying in the xy-plane at z=...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.