Search of fractal space-filling curves with minimal dilation
Yuri Malykhin, Evgeny Shchepin

TL;DR
This paper presents an algorithm using SAT-solvers to find extremal fractal space-filling curves with minimal dilation, discovering new curves with lower dilation values in various dimensions.
Contribution
Introduces a novel SAT-based algorithm for searching extremal fractal curves and reports new minimal dilation curves in dimensions 2, 3, and 4.
Findings
Discovered a new self-similar plane curve 'YE' with dilation 5.5890.
Found 'Spring', a bifractal in 3D with dilation less than 17.
Identified a 4D curve with dilation less than 62.
Abstract
We introduce an algorithm for a search of extremal fractal curves in large curve classes. It heavily uses SAT-solvers~ -- heuristic algorithms that find models for CNF boolean formulas. Our algorithm was implemented and applied to the search of fractal surjective curves with minimal dilation We report new results of that search in the case of Euclidean norm. We have found a new curve that we call "YE", a self-similar (monofractal) plane curve of genus with dilation . In dimension we have found facet-gated bifractals (that we call "Spring") of genus with dilation . In dimension we obtained that there is a curve with dilation . Some lower bounds on the dilation for wider classes of cubically decomposable curves…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Topological and Geometric Data Analysis · Mathematical Approximation and Integration
