Related papers: Threadable Curves
We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic curves defined by means of polynomial parametrizations. The algorithms are based on the existence of a linear relationship between two…
Let X be a smooth, complete, toric variety. We study those curves C in X that are contractible, in the sense that there exists an equivariant morphism with connected fibers, with source X, that contracts exactly the irreducible curves that…
An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a *net*, a connected planar piece with no overlaps. A *grid unfolding* allows additional cuts along grid edges induced by coordinate planes…
A linear series on a curve C in $P^3$ is "primary" when it does not contain the series cut by planes. We provide a lower bound for the degree of these series, in terms of deg(C), g(C) and of the number $s = min{i: h^0(I_C(i))\neq 0}$; as a…
We obtain a recursive formula answering the following question: How many irreducible, plane curves of degree d and (geometric) genus g pass through 3d-1+g general points in the plane? The formula is proved by studying suitable degenerations…
In this paper, we describe an algorithm for fitting an analytic and bandlimited closed or open curve to interpolate an arbitrary collection of points in $\mathbb{R}^{2}$. The main idea is to smooth the parametrization of the curve by…
A new algorithm for the determination of the relative convex hull in the plane of a simple polygon A with respect to another simple polygon B which contains A, is proposed. The relative convex hull is also known as geodesic convex hull, and…
For any chord diagram on a circle there exists a complete graph on sufficiently many vertices such that any generic immersion of it to the plane contains a plane closed curve whose chord diagram contains the given chord diagram as a…
Given a graph $G$ and two vertices $s$ and $t$ in it, {\em graph reachability} is the problem of checking whether there exists a path from $s$ to $t$ in $G$. We show that reachability in directed layered planar graphs can be decided in…
In algebraic geometry, trigonal curves can always be embedded into Hirzebruch surfaces. In tropical geometry, the notion of trigonality does not have a unique translation. We focus on the characterization in terms of the existence of a…
We describe a search for plane-filling curves traversing all edges of a grid once. The curves are given by Lindenmayer systems with only one non-constant letter. All such curves for small orders on three grids have been found. For all…
Let a set of nodes $\mathcal X$ in the plane be $n$-independent, i.e., each node has a fundamental polynomial of degree $n.$ Assume that $\#\mathcal X=d(n,k-3)+3= (n+1)+n+\cdots+(n-k+5)+3$ and $4 \le k\le n-1.$ In this paper we prove that…
By a curve in R^d we mean a continuous map gamma:I -> R^d, where I is a closed interval. We call a curve gamma in R^d at most k crossing if it intersects every hyperplane at most k times (counted with multiplicity). The at most d crossing…
We investigate the relationship among characteristic curves on developable surfaces. In case parameter curves coincide with these curves, we show that the base curve of a developable surface could be either a plane curve, a circular helix,…
In this paper, the problem of bounding the number of reducible curves in a pencil of algebraic plane curves is addressed. Unlike most of the previous related works, each reducible curve of the pencil is here counted with its appropriate…
A novel and deterministic algorithm is presented to detect whether two given rational plane curves are related by means of a similarity, which is a central question in Pattern Recognition. As a by-product it finds all such similarities, and…
We introduce the self-linking number of a smooth closed curve in R^n with respect to a 3-dimensional vector bundle over the curve, provided that some regularity conditions are satisfied. When n=3, this construction gives the classical…
An approach to defining quadratic implicit curves is to prescribe two tangent lines and a secant line going through the points of tangency. This paper will show that this method can be generalized to a higher number of tangents, resulting…
Generalizing the notion of split graphs to uniform hypergraphs, we prove that the class of these hypergraphs can be characterized by a finite list of excluded induced subhypergraphs. We show that a characterization by generalized degree…
Chains are vector-valued signals sampling a curve. They are important to motion signal processing and to many scientific applications including location sensors. We propose a novel measure of smoothness for chains curves by generalizing the…