Related papers: Curve Stitching and Dancing Planets

This paper gives various methods for constructing vector bundles over elliptic curves and more generally over families of elliptic curves. We construct universal families over generalized elliptic curves via spectral cover methods and also…

Let $H$ be a composition of an $\mathbb{R}$-linear planar mapping and $z\mapsto z^n$. We classify the dynamics of $H$ in terms of the parameters of the $\mathbb{R}$-linear mapping and the degree by associating a certain finite Blaschke…

The 2x2 space-filling curve is a type of generalized space-filling curve characterized by a basic unit is in a "U-shape" that traverses a 2x2 grid. In this work, we propose a universal framework for constructing general 2x2 curves where…

Computing an optimal chain of fragments is a classical problem in string algorithms, with important applications in computational biology. There exist two efficient dynamic programming algorithms solving this problem, based on different…

This paper explores the modulus (discrete $p$-modulus) of the family of edge covers on a discrete graph. This modulus is closely related to that of the larger family of fractional edge covers; the modulus of the latter family is guaranteed…

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…

We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…

This paper considers the task of connecting points on a piece of paper by drawing a curve between each pair of them. Under mild assumptions, we prove that many pairwise disjoint curves are unavoidable if either of the following rules is…

We formalize Italian smocking, an intricate embroidery technique that gathers flat fabric into pleats along meandering lines of stitches, resulting in pleats that fold and gather where the stitching veers. In contrast to English smocking,…

We provide the first non-trivial examples of quasi-isometric embeddings between curve complexes. These are induced either by puncturing a closed surface or via orbifold coverings. As a corollary, we give new quasi-isometric embeddings…

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…

This paper proposes a simple technique of curve and surface construction with B-splines. Given a control polygon or a control mesh together with node ordinates corresponding to all control points, a rational curve or surface is obtained by…

This paper presents a novel approach for learning STRIPS action models from examples that compiles this inductive learning task into a classical planning task. Interestingly, the compilation approach is flexible to different amounts of…

We introduce Integral Curve Coordinates, which identify each point in a bounded domain with a parameter along an integral curve of the gradient of a function $f$ on that domain; suitable functions have exactly one critical point, a maximum,…

Starting from a divide, i.e. a generic immersion of finitely many copies of the interval [0,1] in the disk, we construct a classical link in the 3-sphere. We prove that the link's complement fibers over the circle, if the divide is…

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…

We present computational algorithms to work with points on the modular curve associated to the normaliser of a non-split Cartan group of prime level $p$. Rather than working with explicit equations, we represent these points using the…

We give an algorithm for approximating a given plane curve segment by a planar elastic curve. The method depends on an analytic representation of the space of elastic curve segments, together with a geometric method for obtaining a good…

We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…

Tensor network contraction is a fundamental mathematical operation that generalizes the dot product and matrix multiplication. It finds applications in numerous domains, such as database systems, graph theory, machine learning, probability…