Jump to content
  • Advertisement
Sign in to follow this  
tts1980

Weiler-Atherton algorithm: Determining holes arise from union

This topic is 3793 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 all, I just recently started looking at Weiler-Atherton algorithm for polygon boolean operation. In particular, I was looking at union between 2 polygons. Most references on the net I came across describe usage of the algorithm for clipping purpose. Though on 1 reference I found out to get the union I basically just need to traverse the 2 vertex lists in a different way. But what the reference didn't mention was how to figure out any holes that arises from the union. My guess is that given a polygon P and clipping polygon Q, if we start the traverse with an "out" intersection, and return to the intersection point without crossing over to Q, then the vertices found in the traverse forms a hole. Wondering if this is the case? Thuan

Share this post


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

  • Advertisement
×

Important Information

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

Participate in the game development conversation and more when you create an account on GameDev.net!

Sign me up!