Related papers: Deciding when two curves are of the same type
We characterise when a set of simple closed curves in an orientable surface forms a bouquet, in terms of relations between the corresponding Dehn twists.
A classical inequality which is due to Lickorish and Hempel says that the distance between two curves in the curve complex can be measured by their intersection number. In this paper, we show a converse version; the intersection number of…
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…
In this paper we study similarity measures for moving curves which can, for example, model changing coastlines or retreating glacier termini. Points on a moving curve have two parameters, namely the position along the curve as well as time.…
A surface embedded in space, in such a way that each point has a neighborhood within which the surface is a terrain, projects to an immersed surface in the plane, the boundary of which is a self-intersecting curve. Under what circumstances…
A polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish).
Since edge detection is in the forefront of image processing for object detection, it is crucial to have a good understanding of edge detection algorithms. The reason for this is that edges form the outline of an object. An edge is the…
A criterion for the existence of a plane model of an algebraic curve such that the Galois closures of projections from two points are the same is presented. As an application, it is proved that the Hermitian curve in positive characteristic…
A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…
The article analyzes similarity of closed polygonal curves in Frechet metric, which is stronger than the well-known Hausdorff metric and therefore is more appropriate in some applications. An algorithm that determines whether the Frechet…
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…
The notions of equivalence and strict equivalence for order one differential equations are introduced. The more explicit notion of strict equivalence is applied to examples and questions concerning autonomous equations and equations having…
Given two rational, properly parametrized space curves ${\mathcal C}_1$ and ${\mathcal C}_2$, where $\CCC_2$ is contained in some plane $\Pi$, we provide an algorithm to check whether or not there exist perspective or parallel projections…
We derive various inequalities involving the intersection number of the curves contained in geodesics and tight geodesics in the curve graph. While there already exist such inequalities on tight geodesics, our method applies in the setting…
We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized…
We show that the topological classification and the smooth classification are generically the same for certain families of plane curves in a semi-local case(the double local case). Especially we give the normal form of transversely jointed…
We describe an algorithm that determines a set of unramified covers of a given hyperelliptic curve, with the property that any rational point will lift to one of the covers. In particular, if the algorithm returns an empty set, then the…
We introduce an operation that measures the self intersections of paths on a surface. As applications, we give a criterion of the realizability of a generalized Dehn twist, and derive a geometric constraint on the image of the Johnson…
In this article, we study the invariant differential forms which a correspondence of curves admits. We also try to classify the correspondences of $\mathbb{P}^1$ that admits such invariant differential forms.