A New Quasi-Human Algorithm for Solving the Packing Problem of Unit Equilateral Triangles

Ruimin Wang, Xiaozhuo Qi, Yuqiang Luo and Jianqiang Dong

Abstract and Applied Analysis, 2014, vol. 2014, 1-8

Abstract:

The packing problem of unit equilateral triangles not only has the theoretical significance but also offers broad prospects in material processing and network resource optimization. Because this problem is nondeterministic polynomial (NP) hard and has the feature of continuity, it is necessary to limit the placements of unit equilateral triangles before optimizing and obtaining approximate solution (e.g., the unit equilateral triangles are not allowed to be rotated). This paper adopts a new quasi-human strategy to study the packing problem of unit equilateral triangles. Some new concepts are put forward such as side-clinging action, and an approximation algorithm for solving the addressed problem is designed. Time complexity analysis and the calculation results indicate that the proposed method is a polynomial time algorithm, which provides the possibility to solve the packing problem of arbitrary triangles.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AAA/2014/308474.pdf (application/pdf)
http://downloads.hindawi.com/journals/AAA/2014/308474.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlaaa:308474

DOI: 10.1155/2014/308474

Access Statistics for this article

More articles in Abstract and Applied Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().