Sign in to follow this  

determine whether an n-vertex is simple

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

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