Jump to content
  • Advertisement
Sign in to follow this  

Simple polygon intersection

This topic is 2407 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've been looking for an optimal algorithm for the simple polygon intersection problem. That is: given 2 simple polygons (i.e. without self-intersection) report of all intersecting edge pairs in O(n+k), where n - is a number of polygons' edges and k - is a number of intersection. Hence the algorithm is output sensetive. Also for me perfomance is very critical, so linear time is important.

Very strange that I had spent a lot of time googling it but haven't find a lot of information. Just some cases like intersection testing but not reporting or case when polygons are convex. The only thing - is the mentioning that this problem can be solved in given time with a link to U. Finke and K. Hinrichs. Overlaying simply connected planar subdivisions in linear time. Unfortunately I didn't manage to find this papers and I'm not even sure that this is my case. Any thougths?

Thank you in advance.

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!