A framework for dynamic implicit curve approximation by an irregular discrete approach

Antoine Vacavant 1 David Coeurjolly 1 Laure Tougne 1
1 M2DisCo - Geometry Processing and Constrained Optimization
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : The approximation of implicit planar curves by line segments is a very classical problem.Many algorithms use interval analysis to approximate this curve, and to handle the topology of thefinal reconstruction. In this article, we use discrete geometry tools to build an original geometricaland topological representation of the implicit curve. The polygonal approximation contains fewsegments, and the Reebgraph permits to sum up efficiently the shape and the topology of the curve.Furthermore, we propose two algorithms to process local cells refinement and local cells groupingschemes.We illustrate these schemes with a global system thatefficiently handles manual or automatic fast updates on the global reconstruction, by consideringtopological or geometrical constraints.We also compare the speed and the quality of our approach with two classical methods.
Document type :
Journal articles
Complete list of metadatas

Contributor : Équipe Gestionnaire Des Publications Si Liris <>
Submitted on : Tuesday, January 17, 2017 - 1:53:47 PM
Last modification on : Tuesday, February 26, 2019 - 4:29:58 PM


  • HAL Id : hal-01437639, version 1


Antoine Vacavant, David Coeurjolly, Laure Tougne. A framework for dynamic implicit curve approximation by an irregular discrete approach. Graphical Models, Elsevier, 2009, 3, 71, pp.113-124. ⟨hal-01437639⟩



Record views