• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2007, Vol. 29 ›› Issue (12): 93-94.

• 论文 • Previous Articles     Next Articles

  

  • Online:2007-12-01 Published:2010-05-30

Abstract:

Based on the existing intersection test algorithms,a fast coincident intersection test algorithm for 3-D convex polygons based on clamping-edge pairs   is presented, which provides a coincident computational method for the overlap judgement between convex polygons,and expands the algorithm application o   bject to the free 3-D convex polygons. There are two steps in this algorithm. First,decide whether there is a clamping-edge pair in each polygon to the  plane in which the other polygon lies. If the answer is no, it can be determined immediately that the two polygons do not overlap. Second, you should ca  lculate the signed line-line distance between the two clamping-edge pairs of the two polygons and determine wheth- er the two polygons intersect.

Key words: spatial convex polygon, intersection test, clamping-edge, collision detection