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

Provençal, Xavier and Lachaud, Jacques-Olivier. 2009. « Two linear-time algorithms for computing the minimum length polygon of a digital contour ». In Discrete Geometry for Computer Imagery : 15th IAPR International Conference, DGCI 2009, Proceedings (Montreal, QC, Canada, Sept. 30-Oct. 02, 2009) Coll. « Lecture notes in computer science », vol. 5810. pp. 104-117. Springer.
Compte des citations dans Scopus : 19.

The full text of this document is not available here.

Item Type:	Conference proceeding
Professor:	Professor Provençal, Xavier
Affiliation:	Autres
Date Deposited:	06 Dec 2024 16:13
Last Modified:	06 Dec 2024 16:13
URI:	https://espace2.etsmtl.ca/id/eprint/30195

Actions (login required)

View Item