Mar 24, 2016 · Abstract:We present an O(n\log n)-time algorithm that determines whether a given planar n-gon is weakly simple.
Abstract. We present an O(nlog n)-time algorithm that determines whether a given planar n-gon is weakly simple. This improves upon an O(n2 log n)-time ...
Jul 12, 2014 · We describe an algorithm to determine whether a closed walk of length n in a simple plane graph is weakly simple in O(n log n) time, improving ...
Missing: Recognizing | Show results with:Recognizing
We describe an algorithm to determine whether a closed walk of length n in a simple plane graph is weakly simple in O(nlog n) time, improving an earlier O(n3)- ...
Instead of a polygon without forks, we can consider the polygon to be a walk on a plane graph. Similarly we can define a weakly simple walk of a plane graph. We ...
Missing: Recognizing | Show results with:Recognizing
We present an O(n log n)-time algorithm that determines whether a given planar n-gon is weakly simple. This improves upon an O(n^2 log n)-time algorithm by [ ...
Aug 28, 2017 · We present an O ( n log n ) -time algorithm that determines whether a given n-gon in the plane is weakly simple.
We present an $O(n\log n)$-time algorithm that determines whether a given planar $n$-gon is weakly simple. This improves upon an $O(n^2\log n)$-time ...
Weakly simple polygons are required as input for several geometric algorithms. As such, recognizing simple or weakly simple polygons is a fundamental problem.
People also ask
How do you know if a polygon is simple?
How can you identify polygons?
Which polygons are similar?
What is the history of polygons?
An algorithm to determine whether a closed walk of length n in a simple plane graph is weakly simple in O(n log n) time is described, improving an earlier ...
Missing: Recognizing | Show results with:Recognizing