A Heuristic Algorithm for Solving Triangle Packing Problem

The research on the triangle packing problem has important theoretic significance, which has broad application prospects in material processing, network resource optimization, and so forth. Generally speaking, the orientation of the triangle should be limited in advance, since the triangle packing p...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Dynamics in Nature and Society Vol. 2013; no. 2013; pp. 536 - 542-163
Main Authors Wang, Ruiming, Luo, Yuqiang, Dong, Jianqiang, Liu, Shuai, Qi, Xiaozhuo
Format Journal Article
LanguageEnglish
Published Cairo, Egypt Hindawi Limiteds 01.01.2013
Hindawi Puplishing Corporation
Hindawi Publishing Corporation
John Wiley & Sons, Inc
Hindawi Limited
Subjects
Algorithms
Approximation
Colleges & universities
Differential equations, Partial
Heuristic
Heuristic programming
Mathematical research
Networks
Optimization
Orientation
Polygons
Science
Strategy
Triangles
Online AccessGet full text

Cover

More Information
Summary:The research on the triangle packing problem has important theoretic significance, which has broad application prospects in material processing, network resource optimization, and so forth. Generally speaking, the orientation of the triangle should be limited in advance, since the triangle packing problem is NP-hard and has continuous properties. For example, the polygon is not allowed to rotate; then, the approximate solution can be obtained by optimization method. This paper studies the triangle packing problem by a new kind of method. Such concepts as angle region, corner-occupying action, corner-occupying strategy, and edge-conjoining strategy are presented in this paper. In addition, an edge-conjoining and corner-occupying algorithm is designed, which is to obtain an approximate solution. It is demonstrated that the proposed algorithm is highly efficient, and by the time complexity analysis and the analogue experiment result is found.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1026-0226
1607-887X
DOI:10.1155/2013/686845