Related papers: Closing curves by rearranging arcs
In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a straight sequence of segments in such a manner that both the…
A clustering algorithm partitions a set of data points into smaller sets (clusters) such that each subset is more tightly packed than the whole. Many approaches to clustering translate the vector data into a graph with edges reflecting a…
A weak pseudoline arrangement is a topological generalization of a line arrangement, consisting of curves topologically equivalent to lines that cross each other at most once. We consider arrangements that are outerplanar---each crossing is…
We construct invariants for any closed semipositive symplectic manifold which count rational curves satisfying tangency constraints to a local divisor. More generally, we introduce invariants involving multibranched local tangency…
Tripod configurations of plane curves, formed by certain triples of normal lines coinciding at a point, were introduced by Tabachnikov, who showed that $C^2$ closed convex curves possess at least two tripod configurations. Later, Kao and…
By a fixed continuous map from a $3$-space to itself, a knot in the $3$-space may be mapped to another knot in the $3$-space. We analyze possible knot types of them. Then we map a knot repeatedly by a fixed continuous map and analyze…
In a previous work of the authors, a result to algorithmically compute the topology types of the level curves of an algebraic surface, is given. From this result, here we derive applications based on level curves to determine some…
We prove the first polynomial bound on the number of monotonic homotopy moves required to tighten a collection of closed curves on any compact orientable surface, where the number of crossings in the curve is not allowed to increase at any…
We present a novel algorithm for deciding whether a given planar curve is an image of a given spatial curve, obtained by a central or a parallel projection with unknown parameters. A straightforward approach to this problem consists of…
In mathematics curves are typically defined as the images of continuous real functions (parametrizations) defined on a closed interval. They can also be defined as connected one-dimensional compact subsets of points. For simple curves of…
Ordinary maps satisfy topological recursion for a certain spectral curve $(x, y)$. We solve a conjecture from arXiv:1710.07851 that claims that fully simple maps, which are maps with non self-intersecting disjoint boundaries, satisfy…
A curve is rectifying if it lies on a moving hyperplane orthogonal to its curvature vector. In this work, we extend the main result of [Chen 2017, Tamkang J. Math. 48, 209] to any space dimension: we prove that rectifying curves are…
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…
Algebraic curve branches can be classified according to their multiplicity sequences. Arf's solution to this problem using Arf closures and possible implementations of Henselization are discussed.
The main goal of this article is to expand the theory of invariants of Artin-Schreier curves by giving a complete classification in genus 3 and 4. To achieve this goal, we first establish standard forms of Artin-Schreier curves and…
In this paper, we give a Zariski triple of the arrangements for a smooth quartic and its four bitangents. A key criterion to distinguish the topology of such curves is given by a matrix related to the height pairing of rational points…
We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…
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…
For given convex set $K$ in the plane (not necessarily bounded), we can construct the curve $C$ for which the visibility (aperture) angle of this set has the same, prescribed value. We give the implicit formula for $C$, discuss some issues…
In this work, we present a novel approach for reconstructing shape point clouds using planar sparse cross-sections with the help of generative modeling. We present unique challenges pertaining to the representation and reconstruction in…