Login / Signup
An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon.
Robert Endre Tarjan
Christopher J. Van Wyk
Published in:
SIAM J. Comput. (1988)
Keyphrases
</>
simple polygon
worst case
np hard
computational complexity
learning algorithm
matching algorithm
decision trees
optimal solution
fourier transform
data sets
multiscale
image registration
energy function
graph structure