A framework for dynamic implicit curve approximation by an irregular discrete approach - Archive ouverte HAL Access content directly
Journal Articles Graphical Models Year : 2009

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

(1) , (1) , (1)
1

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.
Not file

Dates and versions

hal-01437639 , version 1 (17-01-2017)

Identifiers

  • HAL Id : hal-01437639 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More