Related papers: Folding the Heighway dragon curve

Fractals are geometric shapes that can display complex and self-similar patterns found in nature (e.g., clouds and plants). Recent works in visual recognition have leveraged this property to create random fractal images for model…

Connectivity is a central notion of graph theory and plays an important role in graph algorithm design and applications. With emerging new applications in networks, a new type of graph connectivity problem has been getting more…

By the curve shortening flow, the only closed embedded contracting self-similar solutions are circles: we give a very short and intuitive geometric proof of this basic and classical result using an idea of Gage.

This article gives a comprehensive description of the fractal geometry of conformally-invariant (CI) scaling curves, in the plane or half-plane. It focuses on deriving critical exponents associated with interacting random paths, by…

Here we carefully construct an equivalence between the derived category of coherent sheaves on an elliptic curve and a version of the Fukaya category on its mirror. This is the most accessible case of homological mirror symmetry. We also…

We propose a definition for the similarity dimension of fractal curves with multiple generators.

Feature curves are largely adopted to highlight shape features, such as sharp lines, or to divide surfaces into meaningful segments, like convex or concave regions. Extracting these curves is not sufficient to convey prominent and…

We introduce a novel class of rotation invariants of two dimensional curves based on iterated integrals. The invariants we present are in some sense complete and we describe an algorithm to calculate them, giving explicit computations up to…

There are several interrelated notions of discrete curvature on graphs. Many approaches utilize the optimal transportation metric on its probability simplex or the distance matrix of the graph. In this survey article, we compute formulas…

A convex triangular grid is represented by a planar digraph $G$ embedded in the plane so that (a) each bounded face is surrounded by three edges and forms an equilateral triangle, and (b) the union $\Rscr$ of bounded faces is a convex…

In this article, we study rectifying curves in arbitrary dimensional Euclidean space. A curve is said to be a rectifying curve if, in all points of the curve, the orthogonal complement of its normal vector contains a fixed point. We…

We consider the concept of fractons, i.e. particles or quasiparticles which obey specific fractal distribution function and for each universal class h of particles we obtain a fractal-deformed Heisenberg algebra. This one takes into account…

The Berge-Fulkerson conjecture states that every bridgeless cubic graph can be covered with six perfect matchings such that each edge is covered exactly twice. An equivalent reformulation is that it's possible to find a 6-cycle 4-cover. In…

This paper explores the relationship between closed curves on surfaces and their intersections. Like Dehn-Thurston coordinates for simple curves, we explore how to determine closed curves using the number of times they intersect other…

We characterize when two conic curved creases are compatible with each other, when the rule lines must converge to conic foci and reflect at the crease. Namely, two conics are compatible (can be connected by rule segments in a foldable…

Tree rotations (left and right) are basic local deformations allowing to transform between two unlabeled binary trees of the same size. Hence, there is a natural problem of practically finding such transformation path with low number of…

In this paper, we derive a number of interesting properties and extensions of the convex flow problem from the perspective of convex geometry. We show that the sets of allowable flows always can be imbued with a downward closure property,…

Differential calculus on the space of asymptotically linear curves is developed. The calculus is applied to the vortex filament equation in its Hamiltonian description. The recursion operator generating the infinite sequence of commuting…

Any space-filling packing of spheres can be cut by a plane to obtain a space-filling packing of disks. Here, we deal with space-filling packings generated using inversive geometry leading to exactly self-similar fractal packings. First, we…

Given an edge weighted graph and a forest $F$, the $\textit{2-edge connectivity augmentation problem}$ is to pick a minimum weighted set of edges, $E'$, such that every connected component of $E'\cup F$ is 2-edge connected. Williamson et…