计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (33): 22-24.DOI: 10.3778/j.issn.1002-8331.2008.33.006
• 博士论坛 • 上一篇 下一篇
王瑞民1,何大华2,裴利军3
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
WANG Rui-min1,HE Da-hua2,PEI Li-jun3
Received:
Revised:
Online:
Published:
Contact:
摘要： 给出了矩形的三角形划分问题的定义，该问题是三角形Packing问题的一个特例，证明了该问题是NP完全的，并给出了该问题有解的一个必要条件。
关键词: 三角形Packing问题, 矩形的三角形划分问题, NP完全, 格局
Abstract: The problem called rectangle triangulation problem which is a special case of triangle packing problem is proposed and proved to be NP complete，a necessary condition that ensures the problem have a solution is given.
Key words: triangle packing problem, rectangle triangulation problem, NP complete, configuration
王瑞民1,何大华2,裴利军3. 矩形的三角形划分问题研究[J]. 计算机工程与应用, 2008, 44(33): 22-24.
WANG Rui-min1,HE Da-hua2,PEI Li-jun3. Investigation to rectangle triangulation problem[J]. Computer Engineering and Applications, 2008, 44(33): 22-24.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/10.3778/j.issn.1002-8331.2008.33.006
http://cea.ceaj.org/CN/Y2008/V44/I33/22
