Polygons with inscribed circles and prescribed side lengths

被引：0
|
作者：
Deineko, Vladimir G. [3 ]
Klinz, Bettina [2 ]
Woeginger, Gerhard J. [1 ]
机构：
[1] Eindhoven Univ Technol, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands
[2] Graz Univ Technol, Inst Math B, A-8010 Graz, Austria
[3] Univ Warwick, Warwick Business Sch, Coventry CV4 7AL, W Midlands, England
来源：
APPLIED MATHEMATICS LETTERS | 2009年 / 22卷 / 05期
关键词：
Computational complexity; Combinatorial optimization; Geometry;
D O I：
10.1016/j.aml.2008.05.002
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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. (c) 2008 Elsevier Ltd. All rights reserved.
引用
收藏
页码：704 / 706
页数：3
相关论文
共 50 条
12345