Skip to Main content Skip to Navigation
Journal articles

A Generic and Parallel Algorithm for 2D Digital Curve Polygonal Approximation

Guillaume Damiand 1, * David Coeurjolly 1 
* Corresponding author
1 M2DisCo - Geometry Processing and Constrained Optimization
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : In this paper, we present a generic topological and geometrical framework which allows to define and control several parallel algorithms for 2D digital curve approximation. The proposed technique is based on combinatorial map simplifications guided by geometrical criteria. We illustrate the genericity of the framework by defining three contour simplification methods: a polygonal approximation one based an area deviation computation; a digital straight segments reconstruction one which guaranties to obtain a loss-less representation; and a moment preserving simplification one which simplifies the contours while preserving geometrical moments of the image regions. Thanks to a complete experimental evaluation, we demonstrate that the proposed methods can be efficiently implemented in a multi-thread environment to simplify labeled image contours.
Complete list of metadata
Contributor : Guillaume Damiand Connect in order to contact the contributor
Submitted on : Thursday, October 27, 2011 - 2:02:47 PM
Last modification on : Tuesday, June 1, 2021 - 2:08:07 PM
Long-term archiving on: : Thursday, November 15, 2012 - 10:41:15 AM


Files produced by the author(s)



Guillaume Damiand, David Coeurjolly. A Generic and Parallel Algorithm for 2D Digital Curve Polygonal Approximation. Journal of Real-Time Image Processing, Springer Verlag, 2011, 6 (3), pp.145-157. ⟨10.1007/s11554-011-0193-x⟩. ⟨hal-00636402⟩



Record views


Files downloads