[1]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]
Copy
Journal of Zhengzhou University (Engineering Science)[ISSN
1671-6833/CN
41-1339/T] Volume:
25
Number of periods:
2004年04期
Page number:
52-55
Column:
Public date:
1900-01-01
- Title:
-
An angle-occupying algorithm for solving triangle packing problems
- Author(s):
-
WANG Ruimin; Chen Zhuo
-
-
- Keywords:
-
- CLC:
-
-
- DOI:
-
10.3969/j.issn.1671-6833.2004.04.014
- 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.