Related papers: Threadable Curves
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. Only…
In this paper, the general formulation for inextensible flows of curves on oriented surface in $\mathbb{R}^3 $ is investigated. The necessary and sufficient conditions for inextensible curve flow lying an oriented surface are expressed as a…
A plane tiling consisting of congruent copies of a shape is isohedral provided that for any pair of copies, there exists a symmetry of the tiling mapping one copy to the other. We give a $O(n\log^2{n})$-time algorithm for deciding if a…
A linear connection $D$ in a Lie algebroid is said to be metrizable if there exists a Riemannian metric $h$ in the Lie algebroid such that $Dh=0$. Conditions for the linear connection $D$ to be metrizable are investigated.
A $\textit{polygonal curve}$ is a collection of $m$ connected line segments specified as the linear interpolation of a list of points $\{p_0, p_1, \ldots, p_m\}$. These curves may be obtained by sampling points from an oriented curve in…
Let P^2_r be the projective plane blown up at r generic points. Denote by E_0,E_1,...,E_r the strict transform of a generic straight line on P^2 and the exceptional divisors of the blown-up points on P^2_r respectively. We consider the…
The conchoid of a plane curve $C$ is constructed using a fixed circle $B$ in the affine plane. We generalize the classical definition so that we obtain a conchoid from any pair of curves $B$ and $C$ in the projective plane. We present two…
This paper examines the relationship between the knotting of an embedded surface in $\R^3$ and the knotting of its fold curves, formed by the singular set of projection to a plane. The first result shows that every surface, no matter how…
A point on a plane curve is said to be Galois (for the curve) if the projection from the point as a map from the curve to a line induces a Galois extension of function fields. It is known that the number of Galois points is finite except…
A closed plane meander of order $n$ is a closed self-avoiding curve intersecting an infinite line $2n$ times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm,…
${\cal U}$ntil now the representation (i.e. plotting) of curve in Parallel Coordinates is constructed from the point $\leftrightarrow$ line duality. The result is a ``line-curve'' which is seen as the envelope of it's tangents. Usually this…
Braids can be represented geometrically as curve diagrams. The geometric complexity of a braid is the minimal complexity of a curve diagram representing it. We introduce and study the corresponding notion of geometric generating function.…
A (possibly denerate) drawing of a graph $G$ in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph…
We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible so that each part is crossing-free. Since the problem is…
Guarding a polygon with few guards is an old and well-studied problem in computational geometry. Here we consider the following variant: We assume that the polygon is orthogonal and thin in some sense, and we consider a point $p$ to guard a…
An elliptic divisibility sequence is an integer recurrence sequence associated to an elliptic curve over the rationals together with a rational point on that curve. In this paper we present a higher-dimensional analogue over arbitrary base…
In this paper we show how, under surprisingly weak assumptions, one can split a planar curve into three arcs and rearrange them (matching tangent directions) to obtain a closed curve. We also generalize this construction to curves split…
A grid polygon is a polygon whose vertices are points of a grid. We define an injective map between permutations of length n and a subset of grid polygons on n vertices, which we call consecutive-minima polygons. By the kernel method, we…
Let C be a non-hyperelliptic algebraic curve of genus at least 3. Enriques and Babbage proved 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…
An n-gon is defined as a sequence \P=(V_0,...,V_{n-1}) of n points on the plane. An n-gon \P is said to be convex if the boundary of the convex hull of the set {V_0,...,V_{n-1}} of the vertices of \P coincides with the union of the edges…