Skip to main content
SpringerLink
Log in

Simplifying Triangulations

  • Published:
Discrete & Computational Geometry Aims and scope Submit manuscript

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 is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Agol, I., Hass, J., Thurston, W.: The computational complexity of knot genus and spanning area. Trans. Am. Math. Soc. 358(9), 3821–3850 (2006)

    Article  MathSciNet  Google Scholar 

  2. Bell, M.: Recognising Mapping Classes. PhD thesis, University of Warwick (2015)

  3. Dynnikov, I., Wiest, B.: On the complexity of braids. J. Eur. Math. Soc. 9(4), 801–840 (2007)

    Article  MathSciNet  Google Scholar 

  4. Erickson, J., Nayyeri, A.: Tracing compressed curves in triangulated surfaces. Discret. Comput. Geom. 49(4), 823–863 (2013)

    Article  MathSciNet  Google Scholar 

  5. Farb, B., Margalit, D.: A Primer on Mapping Class Groups. Princeton Mathematical Series, vol. 49. Princeton University Press, Princeton (2012)

    MATH  Google Scholar 

  6. Fellows, M.R.: Parameterized complexity: new developments and research frontiers. In: Aspects of Complexity (Kaikoura 2000). De Gruyter Ser. Log. Appl., vol. 4, pp. 51–72. De Gruyter, Berlin (2001)

  7. Haken, W.: Theorie der Normalflächen. Acta Math. 105, 245–375 (1961)

    Article  MathSciNet  Google Scholar 

  8. Hatcher, A.: On triangulations of surfaces. Topol. Appl. 40(2), 189–194 (1991)

    Article  MathSciNet  Google Scholar 

  9. Mosher, L.: Tiling the projective foliation space of a punctured surface. Trans. Am. Math. Soc. 306(1), 1–70 (1988)

    Article  MathSciNet  Google Scholar 

  10. Penner, R.C.: Tropical lambda lengths, measured laminations and convexity. J. Differ. Geom. 94(2), 343–365 (2013)

    MathSciNet  MATH  Google Scholar 

  11. Schaefer, M., Sedgwick, E., Štefankovič, D.: Algorithms for normal curves and surfaces. In: Computing and Combinatorics (Singapore 2002). Lecture Notes in Computer Science, vol. 2387, pp. 370–380. Springer, Berlin (2002)

    Chapter  Google Scholar 

Download references

Acknowledgements

The author would like to thank Saul Schleimer and Richard Webb for helpful suggestions, in particular for improving the constants used in this result. The author would also like to thank the referees for their careful review and valuable comments. The author also acknowledges support from U.S. National Science Foundation Grants DMS 1107452, 1107263, 1107367 “RNMS: GEometric structures And Representation varieties” (the GEAR Network).

Author information

Authors and Affiliations

  1. University of Illinois, Champaign, USA

    Mark C. Bell

Authors
  1. Mark C. Bell
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mark C. Bell.

Additional information

Editor in Charge: János Pach

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bell, M.C. Simplifying Triangulations. Discrete Comput Geom 66, 1–11 (2021). https://doi.org/10.1007/s00454-021-00309-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00454-021-00309-0

Keywords

Mathematics Subject Classification

Search

Navigation