[1]王瑞民,陈卓..求解三角形Packing问题的占角算法[J].郑州大学学报(工学版),2004,25(04):52-55.[doi:10.3969/j.issn.1671-6833.2004.04.014]
WANG Ruimin,Chen Zhuo.An angle-occupying algorithm for solving triangle packing problems[J].Journal of Zhengzhou University (Engineering Science),2004,25(04):52-55.[doi:10.3969/j.issn.1671-6833.2004.04.014]
点击复制
求解三角形Packing问题的占角算法(
)
《郑州大学学报(工学版)》[ISSN:1671-6833/CN:41-1339/T]
- 卷:
-
25卷
- 期数:
-
2004年04期
- 页码:
-
52-55
- 栏目:
-
- 出版日期:
-
1900-01-01
文章信息/Info
- Title:
-
An angle-occupying algorithm for solving triangle packing problems
- 作者:
-
王瑞民; 陈卓.
-
郑州大学信息工程学院,河南,郑州,450052, 华中科技大学计算机科学与技术学院,湖北,武汉,430074
- Author(s):
-
WANG Ruimin; Chen Zhuo
-
-
- 关键词:
-
三角形; Packing问题; 价值度; 拟人策略
- Keywords:
-
- DOI:
-
10.3969/j.issn.1671-6833.2004.04.014
- 文献标志码:
-
A
- 摘要:
-
三角形Packing问题是NP难的,其完整算法的时间复杂度是指数型的.建立了求解三角形Packing问题的数学模型;沿着拟人的途径,通过把待解决的问题与人类的社会经验作对比,得到了求解三角形Packing问题的若干拟人策略,并以此策略为基础发展出一种高效的近似求解算法.实验结果表明,沿此途径得出的求解三角形Packing问题的算法,针对三角形数目较多的情况,具有较好的完整性和较低的时间复杂度.
- Abstract:
-
The triangle packing problem is NP difficult, and the time complexity of the complete algorithm is exponential. A mathematical model for solving the triangle packing problem was established. Along the anthropomorphic path, by comparing the problem to be solved with human social experience, several anthropomorphic strategies for solving the triangle packing problem are obtained, and an efficient approximation solving algorithm is developed based on this strategy. Experimental results show that the algorithm for solving the triangle packing problem along this path has better completeness and lower time complexity for the case of a large number of triangles.
更新日期/Last Update:
1900-01-01