Collision detection is a prevalent problem in computer graphics. A fast

accurate and feasible collision detection algorithm is important for an application. In this paper

a new planar simple polygon intersection algorithm

based on 2D axis-aligned bounding rectangle data structure

is presented for the polygons subjected to simple and unreformed movement. A new partition strategy for geometrical graphics according to the axial monotony

and the pre-checking process between 2D axis-aligned bounding rectangles reduce the number of unnecessary edge-pairs to be checked efficiently

so the algorithm can terminate promptly. After the partition along with coordinate axis

the interference checking between monotone chains proceeds. A novel search method based on sweep-line theory is adopted to eliminate the number of collision test for both segment-pairs and bounding volume-pairs drastically. So it can prompt the execution of algorithm. The accurate intersections

as well as the first occurrence of intersection between two objects subjected to a dynamic environment

are acquired by less arithmetical operation. The experimental results indicate that the complexity is far less than O(NP×NQ)for generic polygons

even asymptoticallyO(NP+NQ) for two convex polygons

where in NP

NQ denote the vertex number of two polygonsP

Qrespectively. So

it is a fast and efficient algorithm.