Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2013 (2013), Article ID 686845, 7 pages
Research Article

A Heuristic Algorithm for Solving Triangle Packing Problem

1School of Information Engineering, Zhengzhou University, Zhengzhou 450001, China
2Informatization Office, University of Shanghai for Science and Technology, Shanghai 200093, China
3Zhengzhou Xinda Jiean Information Technology Co., Ltd., Zhengzhou 450002, China
4College of Science, University of Shanghai for Science and Technology, Shanghai 200093, China
595107 Troops, Guangzhou 510500, China

Received 20 September 2013; Accepted 24 October 2013

Academic Editor: Guoliang Wei

Copyright © 2013 Ruimin Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.