Determining the intersection of two convex polygons is one of the fundamental problems in computational geometry .I'm asking for an algorithm having:INPUT:Given two convex polygons P and Q in 2D (note that the two convex polygons are represented with p & q points) OUTPUT :compute their intersection?Can any one help me !!!
Convex Polygon Intersection
computational geometry;convex optimization;geometry;constraints
An algorithm for this computation is described in Computational Geometry in C, Chapter 7, Section 6. Code is available at that link. Much of the tricky code is concerned with degenerate cases.Here is a nice Univ Montreal web page (Eric Plante) that describes a different algorithm:link.     