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

Oswin Aichholzer; Wolfgang Mulzer; Alexander Pilz

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

Oswin Aichholzer
, Wolfgang Mulzer
, Alexander Pilz

Institute of Software Engineering and Artificial Intelligence (7160)

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

Original language	German
Title of host publication	Algorithms, 21st Annual European Symposium
Publisher	Springer
Pages	13-24
Publication status	Published - 2013
Event	Annual European Symposium on Algorithms - Sophia Antipolis, France Duration: 2 Sept 2013 → 4 Sept 2013

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer

Conference

Conference	Annual European Symposium on Algorithms
Country/Territory	France
City	Sophia Antipolis
Period	2/09/13 → 4/09/13

Fields of Expertise

Information, Communication & Computing

Treatment code (Nähere Zuordnung)

Basic - Fundamental (Grundlagenforschung)
Theoretical

FWF - ComPoSe - EuroGIAG_Erdös-Szekeres type problems for colored point sets and compatible graphs
Aichholzer, O. (Project manager)
1/10/11 → 31/12/15
Project: Research project

Cite this

@inproceedings{e55abb4a57cc44a5ba0931d078c15da1,

title = "Flip distance between triangulations of a simple polygon is NP-complete",

author = "Oswin Aichholzer and Wolfgang Mulzer and Alexander Pilz",

year = "2013",

language = "deutsch",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "13--24",

booktitle = "Algorithms, 21st Annual European Symposium",

address = "USA / Vereinigte Staaten",

note = "Annual European Symposium on Algorithms ; Conference date: 02-09-2013 Through 04-09-2013",

}

TY - GEN

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

AU - Aichholzer, Oswin

AU - Mulzer, Wolfgang

AU - Pilz, Alexander

PY - 2013

Y1 - 2013

M3 - Beitrag in einem Konferenzband

T3 - Lecture Notes in Computer Science

SP - 13

EP - 24

BT - Algorithms, 21st Annual European Symposium

PB - Springer

T2 - Annual European Symposium on Algorithms

Y2 - 2 September 2013 through 4 September 2013

ER -

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

Publication series

Conference

Fields of Expertise

Treatment code (Nähere Zuordnung)

Projects

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

Cite this