Skip to Main content Skip to Navigation
Conference papers

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

Xavier Provençal 1, * Jacques-Olivier Lachaud 2
* Corresponding author
1 ARITH - Arithmétique informatique
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
2 LAMA - Laboratoire de Mathématiques
Document type :
Conference papers
Complete list of metadatas
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00432378
Contributor : Valerie Berthe <>
Submitted on : Monday, November 16, 2009 - 12:37:19 PM
Last modification on : Thursday, May 24, 2018 - 3:59:21 PM

Links full text

openaccess

Identifiers

Collections

CNRS | UNIV-SAVOIE | LAMA | UGA | ARITH | LIRMM | MIPS | UNIV-MONTPELLIER

Citation

Xavier Provençal, Jacques-Olivier Lachaud. Two-linear time algorithms for computing the minimum length polygon of a digital contour. DGCI'09: Discrete Geometry for Computer Imagery, Sep 2009, Montreal, Canada. pp.104-117, ⟨10.1007/978-3-642-04397-0_10⟩. ⟨lirmm-00432378⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

333

Contact

Informations

CCSD