相关论文: Homeomorphic approximation of the intersection cur…

We give necessary and sufficient topological conditions for a simple closed curve on a real rational surface to be approximable by smooth rational curves. We also study approximation by smooth rational curves with given complex…

Let $\phi:\mathcal{C}(S)\to\mathcal{C}(S')$ be a simplicial isomorphism between the curve graphs of two infinite-type surfaces. In this paper we show that in this situation $S$ and $S'$ are homeomorphic and $\phi$ is induced by a…

We present a method for computing projective isomorphisms between rational surfaces that are given in terms of their parametrizations. The main idea is to reduce the computation of such projective isomorphisms to five base cases by…

In this paper, an algorithm to compute a certified $G^1$ rational parametric approximation for algebraic space curves is given by extending the local generic position method for solving zero dimensional polynomial equation systems to the…

We present some algorithms that provide useful topological information about curves in surfaces. One of the main algorithms computes the geometric intersection number of two properly embedded 1-manifolds $C_1$ and $C_2$ in a compact…

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…

A parameterized surface can be represented as a projection from a certain toric surface. This generalizes the classical homogeneous and bihomogeneous parameterizations. We extend to the toric case two methods for computing the implicit…

In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the parametrization of the curve, and do not require to compute or…

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components. Let $\lambda$ be a simplicial map of the complex of curves, $\mathcal{C}(N)$, on $N$ which satisfies the following: $[a]$ and $[b]$ are…

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…

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…

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components with $g \geq 5$, $n \geq 0$. Let $\mathcal{T}(N)$ be the two-sided curve complex of $N$. If $\lambda :\mathcal{T}(N) \rightarrow…

In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…

We study points of moderately low degree on a curve $C$ over a number field, which is embedded on a nice toric surface $S$. Recently, Smith and Vogt related the linear equivalence classes of such points to intersections of $C$ with curves…

Let $\mathcal C$ be a real plane algebraic curve defined by the resultant of two polynomials (resp. by the discriminant of a polynomial). Geometrically such a curve is the projection of the intersection of the surfaces $P(x,y,z)=Q(x,y,z)=0$…

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 calculate the intersection ring of three-dimensional graph manifolds with rational coefficients and give an algebraic characterization of these rings when the manifold's underlying graph is a tree. We are able to use this…

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.…

In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with…

We classify real families of minimal degree rational curves that cover an embedded rational surface. A corollary is that if the projective closure of a smooth surface is not biregular isomorphic to the projective closure of the unit-sphere,…