Research of the Fast Intersection Test Algorithm on Spatial Convex Polygons

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 object 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 calculate the signed line-line distance between the two clamping-edge pairs of the two polygons and determine whether the two polygons intersect.