The Heighway Dragon Revisited
Discrete & Computational Geometry
We prove that the Heighway dragon is a countable union of closed geometrically similar disk-like planar sets which intersect each other in a linear order: any two of them intersect at no more than one cut point and for any three disks there exist at least two with an empty intersection. Consequently, the interior of the Heighway dragon is a countable union of disjoint open disk-like planar sets. We determine all the cut points of the dragon and show that each disk-like subset between two cut points is a graph self-similar set defined by a graph-directed iterated function system consisting of four seed sets. Our results describe a fairly complete picture of the topological and geometric structure of the Heighway dragon.
Ngai, Sze-Man, Nhu Nguyen.
"The Heighway Dragon Revisited."
Discrete & Computational Geometry, 29 (4): 603-623.
doi: 10.1007/s00454-003-0778-7 source: https://link.springer.com/article/10.1007%2Fs00454-003-0778-7