• Corpus ID: 9918221

Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time

@inproceedings{Schaefer2008ComputingDT,
  title={Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time},
  author={Marcus Schaefer and Eric Sedgwick and Daniel {\vS}tefankovi{\vc}},
  booktitle={Canadian Conference on Computational Geometry},
  year={2008},
  url={https://api.semanticscholar.org/CorpusID:9918221}
}
This work shows that the following two basic tasks of computational topology, namely performing a Dehn-twist of a curve along another curve, and computing the geometric intersection number of two curves can be solved in polynomial time even in the succinct normal coordinate representation.
cs.rochester.edu
25 Citations
Highly Influential Citations
6
Background Citations
13
Methods Citations
6

Figures from this paper

25 Citations

Applications of fast triangulation simplification

A new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation, which runs in polynomial time in the bit-size of the two edge vectors.

Computing the Geometric Intersection Number of Curves

The solution to problem (3) provides a quasi-linear algorithm to a problem raised by Poincaré more than a century ago and gives at best a O(n+g2ℓ2) time complexity on a genus g surface without boundary.

Uniformly polynomial-time classification of surface homeomorphisms

We describe an algorithm which, given two essential curves on a surface S, computes their distance in the curve graph of S, up to multiplicative and additive errors. As an application, we present…

Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries

This paper provides a polynomial-time algorithm which, given an orientable surface and a compressed loop on the surface, computes a canonical form for the loop as a compressed word.

Compressed data structures for Heegaard splittings

This work presents a data structure to effectively represent Heegaard diagrams as normal curves with respect to triangulations of a surface of complexity measured by the space required to express the normal coordinates'vectors in binary.

MOVES ON CURVES ON NON–ORIENTABLE SURFACES

Let Ng,n denote a non–orientable surface of genus g with n punctures and one boundary component. We give an algorithm to calculate the geometric intersection number of an arbitrary multicurve L with…

Recognising mapping classes

This thesis focuses on three decision problems in the mapping class groups of surfaces, namely the reducibility, pseudo-Anosov and conjugacy problems, and gives new solutions to each of these problems that are based on the Bestvina–Handel algorithm, run in polynomial time when given a suitable certificate.

INTERSECTIONS OF MULTICURVES FROM DYNNIKOV COORDINATES

An algorithm for calculating the geometric intersection number of two multicurves on the $n$ -punctured disk, taking as input their Dynnikov coordinates, with main ingredient an algorithm due to Cumplido for relaxing a multicurve.

Computational topology of graphs on surfaces

This work survey results in computational topology that are concerned with graphs drawn on surfaces, which include representing surfaces and graphs embedded on them computationally, deciding whether a graph embeds on a surface, and solving computational problems related to homotopy, optimizing curves and graphs on surfaces.

Spiralling and Folding: the Word View

We show that for every n there are two simple curves on the torus intersecting at least n times without the two curves folding or spiralling with respect to each other. On the other hand, two simple…

24 References

Algorithms for Normal Curves and Surfaces

This paper presents efficient algorithms for counting the number of connected components of curves and surfaces, deciding whether two curves are isotopic, and computing the algebraic intersection numbers of two curves.

The computational complexity of knot and link problems

The problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted is considered and it is shown that this problem, UNKNOTTING PROBLEM, is in NP.

3-manifold knot genus is NP-complet

Recognizing string graphs in NP

It is shown that the recognition problem for string graphs is in NP, and therefore NP-complete, since Kratochvíl showed that the Recognition problem is NP-hard.

Algorithms in the surface mapping class groups

Several algorithms for word-related problem in the mapping class groups are given, in particular an algorithm for the word problem which uses linear number of arithmetic operations in the word length and quadratic in genus for a closed surface.

Decidability of string graphs

We show that string graphs can be recognized in nondeterministic exponential time by giving an exponential upper bound on the number of intersections for a drawing realizing the string graph in the…

Surface diffeomorphisms via train-tracks

Crossing Minimization meets Simultaneous Drawing

It is shown how existing heuristic and exact algorithms for the traditional problem can be adapted to the new task of simultaneous crossing minimization, and report on a brief experimental study of their implementations.

Quadratic Word Equations

The main result says that once the authors have fixed the lengths of a possible solution, then they can decide in linear time whether there is a corresponding solution.

An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs

An O(n2m2) time algorithm using O(nm) space is developed, which outputs a compact representation of all occurrences of P in T, which is superior to the algorithm proposed by Karpinski et al.