Related papers: Segmentation of real algebraic plane curves
In this paper, we first summarize the existing algorithms for computing all the generalized asymptotes of a plane algebraic curve implicitly or parametrically defined. From these previous results, we derive a method that allows to easily…
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic…
Connected components of real algebraic sets are semi-algebraic, i.e. they are described by a boolean formula whose atoms are polynomial constraints with real coefficients. Computing such descriptions finds topical applications in optical…
The paper is an introduction to the use of the classical Newton-Puiseux procedure, oriented to an algorithmic description of it. This procedure enables to get polynomial approximations for parameterizations of branches of an algebraic plane…
The splitting number is effective to distinguish the embedded topology of plane curves, and it is not determined by the fundamental group of the complement of the plane curve. In this paper, we give a generalization of the splitting number,…
We consider the problem of answering connectivity queries on a real algebraic curve. The curve is given as the real trace of an algebraic curve, assumed to be in generic position, and being defined by some rational parametrizations. The…
Spectral Clustering is one of the most traditional methods to solve segmentation problems. Based on Normalized Cuts, it aims at partitioning an image using an objective function defined by a graph. Despite their mathematical attractiveness,…
We associate a half-integer number, called {\em the quantum index}, to algebraic curves in the real plane satisfying to certain conditions. The area encompassed by the logarithmic image of such curves is equal to $\pi^2$ times the quantum…
Our aim is to reprove the basic results of the theory of branches of plane algebraic curves over algebraically closed fields of arbitrary characteristic. We do not use the Hamburger-Noether expansions. Our basic tool is the logarithmic…
Given a real algebraic curve, embedded in projective space, we study the computational problem of deciding whether there exists a hyperplane meeting the curve in real points only. More generally, given any divisor on such a curve, we may…
We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…
We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…
We address the problem of the maximal finite number of real points of a real algebraic curve (of a given degree and, sometimes, genus) in the projective plane. We improve the known upper and lower bounds and construct close to optimal…
We present a certified algorithm that takes a smooth algebraic curve in $\mathbb{R}^n$ and computes an isotopic approximation for a generic projection of the curve into $\mathbb{R}^2$. Our algorithm is designed for curves given implicitly…
Let $Y=\{f(x,y)=0\}$ be the germ of an irreducible plane curve. We present an algorithm to obtain polynomials, whose valuations coincide with the semigroup generators of $Y$. These polynomials are obtained sequentially, adding terms to the…
For affine algebraic plane curves we reduce a calculation of its invariants to calculation of the intersection of kernels of some derivations.
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
We describe new algorithms to compute Whitney stratifications of real algebraic varieties. Using either conormal or polar techniques, these algorithms stratify a complexification of a given real variety. We then show that the resulting…
Two plane analytic branches are topologically equivalent if and only if they have the same multiplicity sequence. We show that having same semigroup is equivalent to having same multiplicity sequence, we calculate the semigroup from a…
In this paper, we present an algorithm for reparametrizing algebraic plane curves from a numerical point of view. That is, we deal with mathematical objects that are assumed to be given approximately. More precisely, given a tolerance…