Related papers: Folding the Heighway dragon curve
Repeatedly folding a strip of paper in half and unfolding it in straight angles produces a fractal: the dragon curve. Shallit, van der Poorten and others showed that the sequence of right and left turns relates to a continued fraction that…
This article describes a new method of producing space filling fractal dragon curves based on a hinged tiling procedure. The fractals produced can be generated by a simple L-system. The construction as a hinged tiling has the advantage of…
In this article we apply an L-system to prove a recurrence formula for the length of the boundary of iterands of the well known Harter-Heighway dragon curve, a space filling curve with fractal boundary. This leads to finding formulas for…
In this work, we study properties of the coordinate functions $x_\theta$ and $y_\theta$ of the dragon curve associated with the angle $\frac{\pi}{3} < \theta < \frac{5\pi}{3}$, and we prove that the box-counting dimension of its graph is…
Let us fold a strip of paper many times in the same direction, and then unfold it to form a fixed angle $\theta$ at all creases. The resulting shape is called the Dragon curve with the unfolding angle $\theta$. When $0\le\theta<90^{\circ}$,…
For many shape analysis problems in computer vision and scientific imaging (e.g., computational anatomy, morphological cytometry), the ability to align two closed curves in the plane is crucial. In this paper, we concentrate on rigidly…
We describe an algorithm to find an L-system for the boundary of space-filling square grid based folding curves, such as the fractal dragon curves. This complements work of Dekking, Arndt, Handl, on space filling curves.
Fractals are ubiquitous natural emergences that have gained increased attention in engineering applications, thanks to recent technological advancements enabling the fabrication of structures spanning across many spatial scales. We show how…
The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid graphs, under different input settings, in theories of bounded…
Jaeger's directed cycle double cover conjecture can be formulated as a problem of existence of special perfect matchings in a class of graphs that we call hexagon graphs. In this work, we explore the structure of hexagon graphs. We show…
It is known that every point on L\'evy's Dragon Curve admits a natural representation as a complex power series. We introduce a directed graph $\mathcal{G}_1$ which characterizes this representation. In this paper, we study the translation…
We formulate the helicaliser, which replaces a given smooth curve by another curve that winds around it. In our analysis, we relate this formulation to the geometrical properties of the self-similar circular fractal (the discrete version of…
The purpose of the present paper is to present the main applications of a new method for the determination of the fractal structure of plane curves. It is focused on the inverse problem, that is, given a curve in the plane, find its fractal…
Various examples of folding curves in $R^{2}$ have been considered: dragons and other square curves, terdragons and other triangular curves, Peano-Gosper curves based on hexagons. They are self-avoiding. They form coverings of $R^{2}$, by…
We consider a subclass of the Cowen-Douglas class in which the problem of deciding whether two operators are similar becomes more manageable. A similarity criterion for Cowen-Douglas operators is known to be dependent on the trace of the…
The complete classification of hexapods - also known as Stewart Gough platforms - of mobility one is still open. To tackle this problem, we can associate to each hexapod of mobility one an algebraic curve, called the configuration curve. In…
A notion of dual curve for pseudoholomorphic curves in 4--manifolds turns out to be possible only if the notion of almost complex structure structure is slightly generalized. The resulting structure is as easy (perhaps easier) to work with,…
We characterize the cut patterns that can be produced by "orthogonal fold & cut": folding an axis-aligned rectangular sheet of paper along horizontal and vertical creases, and then making a single straight cut (at any angle). Along the way,…
We prove the Strong Nine Dragon Tree Conjecture is true if we replace the edge bound with $d + \big\lceil k \big\lfloor\frac{d-1}{k+1}\big\rfloor \big(\frac{d}{k+1} - \frac{1}{2} \big\lceil\frac{d}{k+1}\big\rceil \big)\big\rceil \leq d +…
The fundamental geometry of self-similar sets becomes significantly more complex when the generating contractive maps include non-trivial rotational components. A well-known family exemplifying this complexity is that of the dragon curves…