Sign in to follow this  

binary set operations--2D

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

This topic is 4075 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.

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this