Related papers: Threadable Curves
Inspired by artistic practices such as beadwork and himmeli, we study the problem of threading a single string through a set of tubes, so that pulling the string forms a desired graph. More precisely, given a connected graph (where edges…
We present an algorithm for the following problem. Given a triangulated 3-manifold M and a (possibly non-simple) closed curve on the boundary of M, decide whether this curve is contractible in M. Our algorithm runs in space polynomial in…
We give a criterion when a planar tree-like curve, i.e. a generic immersed plane curve each double point of which cuts it into two disjoint parts, can be send by a diffeomorphism of the plane onto a curve with no inflection points. We also…
A calligraph is a graph that for almost all edge length assignments moves with one degree of freedom in the plane, if we fix an edge and consider the vertices as revolute joints. The trajectory of a distinguished vertex of the calligraph is…
We find a geometrical method of analysing the singularities of a plane nodal curve. The main results will be used in a forthcoming paper on geometric Plucker formulas for such curves. Plane nodal curves, that is plane curves having at most…
In this paper, we contribute toward a classification of two-variable polynomials by classifying (up to an automorphism of $C^2$) polynomials whose Newton polygon is either a triangle or a line segment. Our classification has several…
In the article, we exhibit a series of new examples of rigid plane curves, that is, curves, whose collection of singularities determines them almost uniquely up to a projective transformation of the plane.
Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…
Given a point set, mostly a grid in our case, we seek upper and lower bounds on the number of curves that are needed to cover the point set. We say a curve covers a point if the curve passes through the point. We consider such coverings by…
The `linear orbit' of a plane curve of degree $d$ is its orbit in $\P^{d(d+3)/2}$ under the natural action of $\PGL(3)$. In this paper we obtain an algorithm computing the degree of the closure of the linear orbit of an arbitrary plane…
The group PGL(3) of linear transformations of the projective plane acts naturally on the projective space parametrizing curves of a given degree. In this note we begin the study of the orbits of smooth curves under this action: we construct…
A graph is rectilinear planar if it admits a planar orthogonal drawing without bends. While testing rectilinear planarity is NP-hard in general (Garg and Tamassia, 2001), it is a long-standing open problem to establish a tight upper bound…
The `linear orbit' of a plane curve of degree d is its orbit in P^{d(d+3)/2} under the natural action of PGL(3). We classify curves with positive dimensional stabilizer, and we compute the degree of the closure of the linear orbits of…
A plane curve is called strange if its tangent line at any smooth point passes through a fixed point, called the strange point. In this paper, we study $\mathbb{A}^1$-curves on the complement of a rational strange curve of degree $p$ in…
Let $C$ be a non-hyperelliptic algebraic curve. It is known that its canonical image is the intersection of the quadrics that contain it, except when $C$ is trigonal (that is, it has a linear system of degree 3 and dimension 1) or…
For each integer n, an n-folding curve is obtained by folding n times a strip of paper in two, possibly up or down, and unfolding it with right angles. Generalizing the usual notion of infinite folding curve, we define complete folding…
Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…
A 2-dimensional point-line framework is a collection of points and lines in the plane which are linked by pairwise constraints that fix some angles between pairs of lines and also some point-line and point-point distances. It is rigid if…
Abstractly, tropical hyperelliptic curves are metric graphs that admit a two-to-one harmonic morphism to a tree. They also appear as embedded tropical curves in the plane arising from triangulations of polygons with all interior lattice…
A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all interior regions can be fitted in a rectangular enclosure. If…