Determining the intersection of two convex polygons is one of the fundamental problems in computational geometry . I'm asking for an algorithm having:
Given two convex polygons P and Q in 2D (note that the two convex polygons are represented with p & q points)
compute their intersection?
Can any one help me !!!