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

Oswin Aichholzer, Wolfgang Mulzer, Alexander Pilz

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original languageEnglish
Title of host publication29th European Workshop on Computational Geometry
Publisher.
Pages115-118
Publication statusPublished - 2013
EventEuropean Workshop on Computational Geometry - Braunschweig, Germany
Duration: 18 Mar 2013 → 20 Feb 2014

Conference

ConferenceEuropean Workshop on Computational Geometry
CountryGermany
CityBraunschweig
Period18/03/13 → 20/02/14

Fields of Expertise

  • Information, Communication & Computing

Treatment code (Nähere Zuordnung)

  • Basic - Fundamental (Grundlagenforschung)
  • Theoretical

Projects

FWF - ComPoSe - EuroGIAG_Erdös-Szekeres type problems for colored point sets and compatible graphs

Aichholzer, O.

1/10/11 → 31/12/15

Project: Research project

Cite this

Aichholzer, O., Mulzer, W., & Pilz, A. (2013). Flip distance between triangulations of a simple polygon is NP-complete. In 29th European Workshop on Computational Geometry (pp. 115-118). ..