摘要
提出了三角形的两种放置动作———贴合动作和粘靠动作 ,在此基础上按照最小损伤策略设计了求解单位等边三角形Packing问题的最小损伤法 .计算结果表明 ,该算法具有较高的速度和完整度 ,以此算法为基础 。
Based on two types of placements called sticking placement and leaning placement and the least destroying strategy, an approximate algorithm called the least destroying algorithm for solving dense packings of unit equilateral triangles in a square is developed. The computing results show that the least destroying algorithm is of high performance and integrity. Based on this, an efficient algorithm for solving polygon packing problem can be developed.
出处
《华中科技大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2001年第11期29-31,共3页
Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金
高等学校博士学科点专项科研基金资助项目
中国科学院软件研究所计算机科学开放研究实验室课题基金资助项目
