摘要
研究了简单多边形P沿正则曲线σ作刚体运动时是否与平面上另一固定的简单多边形Q碰撞的判断问题,给出了在最坏情况下最优时间复杂度的完备算法,并在P为凸多边形时。
Collision with a fixed simple polygon Q may occur while a simple polygon P takes a rigid body displacement along regular curve σ . An optimal algorithm in worst case for collision test is given on O(mn) time, where m and n are sizes of P and Q . When P is a convex polygon, another practical algorithm for this collision test is designed by boundary combination operation of polygons and winding number with its algebraic properties.
出处
《计算机学报》
EI
CSCD
北大核心
1999年第12期1332-1334,共3页
Chinese Journal of Computers