摘要
设P和Q是平面内任意两个互不相交的凸多边形,目前确定P与Q的可碰撞区域的最佳串行算法时间复杂度为O(n+m),其中n和m分别为凸多边形P和Q的顶点个数.在该算法的基础上构造了一个易于并行化的求支撑点的串行算法,进而给出了在MIMD-CREW模型上确定可碰撞区域的并行算法,其时间复杂度为O((S+log_2(n+m))log_2(n+m)/log_2S)。
Let P and Q be two arbitrary disjoint convex polygons in a plane. the time-complexityof the optimal serial algorithm currently used for determining the region of collision possibili-ty between P and Q is O(n+m),where n and m refer to the number of vertices in convexpolygons P and Q, respectively. Based on this serial algorithm,a serial algorithm easy toparallelize for finding the supporting point according to the properties of the inclined support-ing line of the convex polygon is developed.The algorithm is then parallelized on the modelMIMD-CREW using the divide-and-rule strategy so as to work out a parallel algorithm todetermine the region of possible collision of convex polygons.the time-complexity of the al-gorithm proposed is O((S+log_2(n+m))log_2(n+m)/log_2S),where S is the number of the processors.
出处
《华中理工大学学报》
CSCD
北大核心
1994年第6期5-9,共5页
Journal of Huazhong University of Science and Technology
基金
国家自然科学基金
863高科技基金
关键词
并行算法
凸多边形
可碰撞性
parallel algorithm
convex polygons
possible collision
supporting line