A Polynomial Time Complexity Bound for Computations on Curves.

Published in: SIAM J. Comput. (1998)

Keyphrases

polynomial time complexity
np complete
upper bound
min cut max flow
lower bound
error bounds
worst case
b spline
planar curves
control points
closed curves
implicit polynomial
np hard
computational complexity
computer vision
digital curves
smooth curves