一种新的凸多边形不干涉算法  

New non-interference approach for convex polygons

作　　者：黎自强[1] 滕弘飞[1] 

机构地区：[1]大连理工大学计算机科学与工程系

出　　处：《计算机工程与应用》2008年第1期11-13,共3页Computer Engineering and Applications

基　　金：国家自然科学基金(the National Natural Science Foundation of China under Grant No.50575031);湖南省教育厅资助科研课题(the Re-search Project of Department of Education of Hunan Province,China under Grant No.06C837)。

摘　　要：求解Packing问题、计算机辅助设计、机器人路径规划、虚拟装配等经常用到凸多边形的不干涉算法。该文根据不适合多边形的概念,通过给定的平移规则控制平移多边形中心的移动方向和位移量而计算出两凸多边形的不适合多边形,进而提出了一种新的凸多边形不干涉算法。最后用实例说明了它在布局求解中的应用。文中方法不存在斜率图算法的缺陷,其计算复杂度为O(n+m)。When solving problems of interference such as packing,robot motion planning,virtual assembly and so on,non- interference algorithm for convex polygons is often used.According to concept of no-fit polygon,this paper computes of no-fit polygon for two convex polygons by controlling motion direction and displacement quantity.Further a new non-interference approach for two convex polygons is presented.Finally,this paper gives out an example to account for its application in complex layout solution.Approach in this paper overcomes shortcomings of algorithm of slope chart,its computation complexity is O（n＋m）.

关 键 词：凸多边形 不干涉检测 不适合多边形 

分 类 号：TP242.2[自动化与计算机技术—检测技术与自动化装置]