Simplifying triangulations
classification
🧮 math.GT
cs.CG
keywords
curvegivenalgorithmbit-sizecompletedehnflipsgive
read the original abstract
We give a new algorithm to simplify a given triangulation with respect to a given curve. The simplification uses flips together with powers of Dehn twists in order to complete in polynomial time in the bit-size of the curve.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.