Jump to content
  • Advertisement
Sign in to follow this  
sedef

determine whether an n-vertex is simple

This topic is 3906 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 everyone, I could not solve this problem in nlogn time. Someone have any idea? Please help. I need some tips.. Give an O(n log n)time algorithm to determine whether an n-vertex polygon is simple, but not necessarily convex. Thanks in advance Greetings, Sedef

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!