Related papers: Topology of 2D and 3D Rational Curves
We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose…
This paper addresses the problem of determining the symmetries of a plane or space curve defined by a rational parametrization. We provide effective methods to compute the involution and rotation symmetries for the planar case. As for space…
Given a family of rational curves depending on a real parameter, defined by its parametric equations, we provide an algorithm to compute a finite partition of the parameter space (${\Bbb R}$, in general) so that the shape of the family…
In this paper we provide, first, a general symbolic algorithm for computing the symmetries of a given rational surface, based on the classical differential invariants of surfaces, i.e. Gauss curvature and mean curvature. In practice, the…
In this paper we provide a computational approach to the shape of curves which are rational in polar coordinates, i.e. which are defined by means of a parametrization (r(t),\theta(t)) where both r(t),\theta(t) are rational functions. Our…
In a previous work of the authors, a result to algorithmically compute the topology types of the level curves of an algebraic surface, is given. From this result, here we derive applications based on level curves to determine some…
In this paper, we study unirational differential curves and the corresponding differential rational parametrizations. We first investigate basic properties of proper differential rational parametrizations for unirational differential…
We consider the problem of computing the topology and describing the geometry of a parametric curve in $\mathbb{R}^n$. We present an algorithm, PTOPO, that constructs an abstract graph that is isotopic to the curve in the embedding space.…
Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…
An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise Linear Structure (PLS) isotopic to the original space curve.…
We present an algorithm for computing curves and families of curves of prescribed degree and geometric genus on real rational surfaces.
In this paper we present an algorithm to compute the (real and complex) straight lines contained in a rational surface, defined by a rational parameterization. The algorithm relies on the well-known theorem of Differential Geometry that…
In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences,…
A method is presented for computing all the affine equivalences between two rational ruled surfaces defined by rational parametrizations that works directly in parametric rational form, i.e. without computing or making use of the implicit…
We present a matrix-based algorithm for deciding if the parametrization of a curve or a surface is invertible or not, and for computing the inverse of the parametrization if it exists.
We present an algorithm that covers any given rational ruled surface with two rational parametrizations. In addition, we present an algorithm that transforms any rational surface parametrization into a new rational surface parametrization…
One distinguishing feature of rational curves is that they have algebraic parameterizations. Arc spaces are a way of describing approximations to parameterizations of all curves in some fixed space. Playing on these descriptions, this paper…
Given a non-rational real space curve and a tolerance $\epsilon>0$, we present an algorithm to approximately parametrize the curve. The algorithm checks whether a planar projection of the space curve is $\epsilon$-rational and, in the…
The aim of this paper is to discuss some applications of general topology in computer algorithms including modeling and simulation, and also in computer graphics and image processing. While the progress in these areas heavily depends on…
We present an approach to a large class of enumerative problems concerning rational curves in projective spaces. This approach uses analysis to obtain topological information about moduli spaces of stable maps. We demonstrate it by…