Login / Signup

Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour.

Xavier ProvençalJacques-Olivier Lachaud
Published in: DGCI (2009)
Keyphrases
  • minimum length
  • worst case
  • computationally efficient
  • image processing
  • object recognition
  • active contours
  • deformable models
  • simple polygon