Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (1): 11-13.

• 博士论坛 • Previous Articles     Next Articles

New non-interference approach for convex polygons

LI Zi-qiang1,2,4,TENG Hong-fei1,3   

  1. 1.Department of Computer Science and Engineering,Dalian University of Technology,Dalian,Liaoning 116024,China
    2.School of Information & Engineering of Xiangtan University,Xiangtan,Hunan 411105,China
    3.School of Mechanical Engineering of Dalian University of Technology,Dalian,Liaoning 116024,China
    4.Key Laboratory for Precision & Non-traditional Machining of Ministry of Education,Dalian,Liaoning 116024,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-01-01 Published:2008-01-01
  • Contact: LI Zi-qiang

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

黎自强1,2,4,滕弘飞1,3   

  1. 1.大连理工大学 计算机科学与工程系,辽宁 大连 116024
    2.湘潭大学 信息工程学院,湖南 湘潭 411105
    3.大连理工大学 机械工程学院,辽宁 大连 116024
    4.精密与特种加工教育部重点实验室,辽宁 大连 116024
  • 通讯作者: 黎自强

Abstract: 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).

Key words: polygon, non-interference detection, no fit polygon

摘要: 求解Packing问题、计算机辅助设计、机器人路径规划、虚拟装配等经常用到凸多边形的不干涉算法。该文根据不适合多边形的概念,通过给定的平移规则控制平移多边形中心的移动方向和位移量而计算出两凸多边形的不适合多边形,进而提出了一种新的凸多边形不干涉算法。最后用实例说明了它在布局求解中的应用。文中方法不存在斜率图算法的缺陷,其计算复杂度为O(n+m)。

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