Link to home
Start Free TrialLog in
Avatar of spiffles
spiffles

asked on

Polygon\Polygon Intersection

Hi,
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. :)
ASKER CERTIFIED SOLUTION
Avatar of tpanar
tpanar

Link to home
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
Start Free Trial
SOLUTION
Link to home
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
Start Free Trial
Avatar of spiffles
spiffles

ASKER

Well for concave, return an array of the polygons formed
SOLUTION
Avatar of ozo
ozo
Flag of United States of America image

Link to home
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
Start Free Trial