Flip distance between triangulations of a simple polygon is NP-complete

Oswin Aichholzer, Wolfgang Mulzer, Alexander Pilz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageGerman
Title of host publicationAlgorithms, 21st Annual European Symposium
PublisherSpringer
Pages13-24
Publication statusPublished - 2013
EventAnnual European Symposium on Algorithms - Sophia Antipolis, France
Duration: 2 Sep 20134 Sep 2013

Publication series

NameLecture Notes in Computer Science
PublisherSpringer

Conference

ConferenceAnnual European Symposium on Algorithms
CountryFrance
CitySophia Antipolis
Period2/09/134/09/13

Fields of Expertise

  • Information, Communication & Computing

Treatment code (Nähere Zuordnung)

  • Basic - Fundamental (Grundlagenforschung)
  • Theoretical

Projects

Cite this

Aichholzer, O., Mulzer, W., & Pilz, A. (2013). Flip distance between triangulations of a simple polygon is NP-complete. In Algorithms, 21st Annual European Symposium (pp. 13-24). (Lecture Notes in Computer Science). Springer.