Polygon\Polygon Intersection

Im looking for an algorithm that works out the intersecting polygon
of 2 polygons (a set of points that result in an enclosed shape).
The polygon can be either concave, convex, simple or/and complex.
The prototype for the function is along the lines of:
CAreaFeature* CAreaFeature::Intersect(CAreaFeature*);

If anyone has any C/C++ code that does this, it would be much
appreciated. :)
Who is Participating?
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

From Graphics Gems

See code @ http://ftp.arl.mil/ftp/pub/Gems/original/RayPolygonIntersect.c


Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
If the polygons can be concave, it is possible that the intersection would not be a single polygon.
spifflesAuthor Commented:
Well for concave, return an array of the polygons formed
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
Game Programming

From novice to tech pro — start learning today.

Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.