Jump to content
  • Advertisement
Sign in to follow this  
f_shaukat

Implemenation of the polygon operation (difference, union, intersection) algorithm.

This topic is 3740 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Dear All, Does any one know how can i get implementation of the following algorithm for the concave polygon(with holes) operations (union, intersection, difference). Polygon Comparison using a Graph Representation by Kevin Weiler - 1980. Thanks in advance Faisal

Share this post


Link to post
Share on other sites
Advertisement
Thinking back about 15 years... IIRC, Graphics Principles and Practice by Foley, van Dam, et al. link has a section, and very possibly in-book code for this algorithm. That's the one where the intersecting edges are doubled up (with opposite orientation) to create individual polygons, right?

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!