Two linear-time algorithms for computing the minimum length polygon of a digital contour.

Jacques-Olivier Lachaud Xavier Provençal

Published in: Discret. Appl. Math. (2011)

Keyphrases

minimum length
worst case
digital curves
efficient implementation
computationally efficient
computer vision
multiscale
d objects
co occurrence
optimization problems
polygonal approximation