Segmentation of real algebraic plane curves

TL;DR

This paper presents an efficient and simplified implementation of a standard algorithm for segmenting real algebraic plane curves, utilizing global information to improve counting at critical points.

Contribution

The authors provide a more efficient and simpler implementation of the curve segmentation algorithm, enhancing the counting of half-branches at critical points using global information.

Findings

Implementation is more efficient than previous methods.

Simplifies the process of curve segmentation.

Uses global information for better counting at critical points.

Abstract

In this article we give an implementation of the standard algorithm to segment a real algebraic plane curve defined implicitly. Our implementation is efficient and simpler than previous. We use global information to count the number of half-branches at a critical point.