Polygons with inscribed circles and prescribed side lengths

V.G. Deineko, B. Klinz, G.J. Woeginger

Research output: Contribution to journalArticleAcademicpeer-review


We prove NP-completeness of the following problem: For n given input numbers, decide whether there exists an n-sided, plane, convex polygon that has an inscribed circle and that has the input numbers as side lengths.
Original languageEnglish
Pages (from-to)704-706
JournalApplied Mathematics Letters
Issue number5
Publication statusPublished - 2009


Dive into the research topics of 'Polygons with inscribed circles and prescribed side lengths'. Together they form a unique fingerprint.

Cite this