A Simple Linear Algorithm for Intersecting Convex Polygons

by Éric Plante, as a course project for

Computational Geometry at

The McGill School of Computer Science

from the article of the same name by  Godfried Toussaint   pages finalized December 9, 1997  

These pages present an elegant method for building a polygon which corresponds to the intersection of two convex polygons.  An interactive applet is also provided to illustrate the technique.

Follow the links below:


Main Page 

 About the Article 

 The Algorithm 

The Applet 

    plante@iro.umontreal.ca  home page