Jacques-Olivier Lachaud
Jacques-Olivier Lachaud
Home
Featured Research
Publications
Talks
Events
Projects
Gallery
Teaching
Experience
Students
Contact
CV
Privacy/Legal mentions
Light
Dark
Automatic
minimum perimeter polygon
Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model
Deformable models have shown great potential for image segmentation. They include discrete models whose combinatorial formulation leads …
G. Damiand
,
A. Dupas
,
Jacques-Olivier Lachaud
PDF
Cite
Project
Dynamic Minimum Length Polygon
This paper presents a formal framework for representing all reversible polygonalizations of a digital contour (i.e. the boundary of a …
Jacques-Olivier Lachaud
,
X. Provençal
PDF
Cite
Project
Slides (PDF)
Two linear-time algorithms for computing the minimum length polygon of a digital contour
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the …
Jacques-Olivier Lachaud
,
X. Provençal
PDF
Cite
Project
Two linear-time algorithms for computing the minimum length polygon of a digital contour
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the …
X. Provençal
,
Jacques-Olivier Lachaud
PDF
Cite
Project
URL
Cite
×