Related papers: Deciding when two curves are of the same type
A suitable measure for the similarity of shapes represented by parameterized curves or surfaces is the Fr\'echet distance. Whereas efficient algorithms are known for computing the Fr\'echet distance of polygonal curves, the same problem for…
In this paper, we deal with the gluing of two surfaces, where the gluing locus is assumed to be a curve. We consider a moving frame along the gluing locus, and define developable surfaces with respect to the frame. Considering geometric…
It is shown that various questions about the existence of simple closed curves in normal subgroups of surface groups are undecidable.
We bound the genus of a projective curve lying on a complete intersection surface in terms of its degree and the degrees of the defining equations of the surface on which it lies.
We present a novel, deterministic, and efficient method to detect whether a given rational space curve is symmetric. By using well-known differential invariants of space curves, namely the curvature and torsion, the method is significantly…
It is well known that plane curves with the same endpoints are homotopic. An analogous claim for plane curves with the same endpoints and bounded curvature still remains open. In this work we find necessary and sufficient conditions for two…
We determine the crossing number of polynomial size curve systems on standard surfaces, in terms of the genus, up to high precision.
We give a sharp lower bound on the area of the domain enclosed by an embedded curve lying on a two-dimensional sphere, provided that geodesic curvature of this curve is bounded from below. Furthermore, we prove some dual inequalities for…
We give an exponential upper and a quadratic lower bound on the number of pairwise non-isotopic simple closed curves can be placed on a closed surface of genus g such that any two of the curves intersects at most once. Although the gap is…
We classify invariant curves for birational surface maps that are expanding on cohomology. When the expansion is exponential, the arithmetic genus of an invariant curve is at most one. This implies severe constraints on both the type and…
We study the order of lengths of closed geodesics on hyperbolic surfaces. Our first main result is that the order of lengths of curves determine a point in Teichm\"uller space. In an opposite direction, we identify classes of curves whose…
Curves in ${\mathbb R}^n$ for which the ratios between two consecutive curvatures are constant are characterized by the fact that their tangent indicatrix is a geodesic in a flat torus. For $n= 3,4$, spherical curves of this kind are also…
We give a combinatorial description of closed curves on oriented surfaces in terms of certain permutations, called charts. We describe automorphisms of curves in terms of charts and compute the total number of curves counted with…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
We introduce a new cohomology-theoretic method for classifying generic immersed curves in closed compact surfaces by using Gauss codes. This subsumes a result of J.S. Carter on classifying immersed curves in oriented compact surfaces, and…
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 study geometric properties of linear strata of uni-singular curves. The singularities of closures of the strata are resolved and the resolutions are represent as projective bundles. This enables to study their geometry. In particular we…
Given an ordered sequence of $N$-choose-2 integers, we give necessary and sufficient conditions to have an ordered collection of $N$ simple closed curves on a torus such that the algebraic pairwise intersections of those curves are the…
We describe a normal surface algorithm that decides whether a knot, with known degree of the colored Jones polynomial, satisfies the Strong Slope Conjecture. We also discuss possible simplifications of our algorithm and state related open…
Plotting solution sets for particular equations may be complicated by the existence of turning points. Here we describe an algorithm which not only overcomes such problematic points, but does so in the most general of settings. Applications…