文摘
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 the final reconstruction. In this article, we use discrete geometry tools to build an original geometrical and topological representation of the implicit curve. The polygonal approximation contains few segments, and the Reeb graph 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 grouping schemes. We illustrate these schemes with a global system that efficiently handles manual or automatic fast updates on the global reconstruction, by considering topological or geometrical constraints. We also compare the speed and the quality of our approach with two classical methods.