Jump to content
  • Advertisement
Sign in to follow this  

binary set operations--2D

This topic is 4291 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

Hi:) I am trying to obtain the union or difference of a concave polygon(without holes) and a rectangle where the rectangle can intersect with the polygon at most at 2 points.Do you know any efficient algorithms for that purpose?( since I have only been able to triangulate the concave polygon ) Thanks:)

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!