Search of fractal space-filling curves with minimal dilation

Yuri Malykhin, Evgeny Shchepin

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 $\gamma\colon[0,1]\to[0,1]^d$ with minimal dilation $$\sup_{t_1

Knowledge Graph



Sign up or login to leave a comment