中文摘要：

NP难度问题的求解一直是计算机科学技术的一个瓶颈任务。自20世纪70年代以来的研究结果表明，求解NP难度问题不存在既完整严格又不太慢的求解算法。三角形Packing问题是NP难的。给出了泊位的定义，并给出了求解三角形Packing问题的拟物策略。以拟物策略为基础发展出拟物算法。实验结果表明，拟物算法具有较高的完整性。

英文摘要：

Solving NP hard problems is always the bottleneck task for computer science and techniques.Investigations from the 1970＇s to now show that for NP hard problems,these does not exist an algorithm that is both complete and rigorous and not too slow.The triangles packing problem,is one of the NP hard problems.According to physical approach, some strate- gies for tackling the triangles packing problem are presented and a highly efficient approximate algorithms have been devel- oped based on two strategies.The result of the test indicates that the algorithm to solve the triangles packing problem by us- ing quasiphysical approach is of high efficiently.