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 !!!

  • 5
    $\begingroup$ This question does not show any research effort. $\endgroup$ – user3883 Dec 29 '14 at 15:52

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.

          Plante fig

| cite | improve this answer | |

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.