Related papers: Implicitization Of A Plane Curve Germ
Let $F\in \mathbb{K}[X, Y ]$ be a polynomial of total degree $D$ defined over a perfect field $\mathbb{K}$ of characteristic zero or greater than $D$. Assuming $F$ separable with respect to $Y$ , we provide an algorithm that computes the…
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…
Let $S$ be a Puiseux series of the germ of an analytically irreducible plane curve $Z$. We provide a new perspective to construct a set of polynomials $F=\{F_1,\ldots, F_{g-1}\}$ associated to $S$, which is a special choice of maximal…
Let X be a plane in a torus over an algebraically closed field K, with tropicalization the matroidal fan Sigma. In this paper we present an algorithm which completely solves the question whether a given one-dimensional balanced polyhedral…
In this paper, we present a solution to the problem of the analytic classification of germs of plane curves with several irreducible components. Our algebraic approach follows precursive ideas of Oscar Zariski and as a subproduct allow us…
In this paper, we focus on computing the kernel of a map of polynomial rings $\varphi$. This core problem in symbolic computation is known as implicitization. While there are extremely effective Gr\"obner basis methods used to solve this…
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…
Let $f$ be a plane curve. We give a procedure based on Abhyankar's approximate roots to detect if it has a single place at infinity, and if so construct its associated $\delta$-sequence, and consequently its value semigroup. Also for fixed…
Let $x=t^n$, $y=\sum_{i=1}^{\infty}a_it^i$ be a parametrisation of the germ of a complex plane analytic curve $\Gamma$ at the origin. Then $\Gamma$ has the implicit equation $f(x,y)=0$ in the neighbourhood of the origin, where $f=\sum…
We develop a method for computing all the {\it generalized asymptotes} of a real plane algebraic curve $\cal C$ over $\Bbb C$ implicitly defined by an irreducible polynomial $f(x,y)\in {\Bbb R}[x,y]$. The approach is based on the notion of…
This final degree project is devoted to study the topological classification of complex plane curves. These are subsets of $\mathbb{C}^2$ that can be described by an equation $f(x,y)=0$. Loosely speaking, curves are said to be equivalent in…
We present a new algorithm for computing integral bases in algebraic function fields of one variable, or equivalently for constructing the normalization of a plane curve. Our basic strategy makes use of the concepts of localization and…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
A polar hypersurface P of a complex analytic hypersurface germ, f=0, can be investigated by analyzing the invariance of certain Newton polyhedra associated to the image of P, with respect to suitable coordinates, by certain morphisms…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
Consider a rational family of planar rational curves in a certain region of interest. We are interested in finding an approximation to the implicit representation of the envelope. Since exact implicitization methods tend to be very costly,…
Converting a parametric curve into the implicit form, which is called implicitization, has always been a popular but challenging problem in geometric modeling and related applications. However, the existing methods mostly suffer from the…
Germs of plane curve singularities can be classified accordingly to their equisingularity type. For singularities over C, this important data coincides with the topological class. In this paper, we characterise a family of singularities,…
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…