Title of article :
Polygons with inscribed circles and prescribed side lengths
Author/Authors :
De?neko، نويسنده , , Vladimir G. and Klinz، نويسنده , , Bettina and Woeginger، نويسنده , , Gerhard J.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2009
Abstract :
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.
Keywords :
computational complexity , Geometry , Combinatorial optimization
Journal title :
Applied Mathematics Letters
Journal title :
Applied Mathematics Letters
