TY - JOUR
T1 - Polygons with inscribed circles and prescribed side lengths
AU - Deineko, V.G.
AU - Klinz, B.
AU - Woeginger, G.J.
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
U2 - 10.1016/j.aml.2008.05.002
DO - 10.1016/j.aml.2008.05.002
M3 - Article
SN - 0893-9659
VL - 22
SP - 704
EP - 706
JO - Applied Mathematics Letters
JF - Applied Mathematics Letters
IS - 5
ER -