Skip to main content
Log in

Search of Fractal Space-Filling Curves with Minimal Dilation

  • Published:
Discrete & Computational Geometry Aims and scope Submit manuscript

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 \(\gamma :[0,1]\rightarrow [0,1]^d\) with minimal dilation

$$\begin{aligned} \sup _{t_1<t_2}\frac{\Vert \gamma (t_2)-\gamma (t_1)\Vert ^d}{t_2-t_1}. \end{aligned}$$

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 \(5\times 5\) with dilation \(5+{43}/{73}=5.5890\ldots \)  In dimension 3 we have found facet-gated bifractals (which we call “Spring”) of genus \(2\times 2\times 2\) with dilation \(<17\). In dimension 4 we obtained that there is a curve with dilation \(<62\). Some lower bounds on the dilation for wider classes of cubically decomposable curves are proven.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Data availability

The datasets generated during and/or analysed during the current study are available in the GitHub repository at https://github.com/malykhin-yuri/peano.

Notes

  1. https://github.com/malykhin-yuri/peano

References

  1. Audemard, G., Lagniez, J.-M., Simon, L.: Improving glucose for incremental SAT solving with assumption: application to MUS extraction. In: 16th International Conference on Theory and Applications of Satisfiability Testing (Helsinki 2013). Lecture Notes in Computer Science, vol. 7962, pp. 309–317. Springer, Heidelberg (2013)

  2. Bader, M.: Space-Filling Curves. Texts in Computational Science and Engineering, vol. 9. Springer, Heidelberg (2013)

    Book  Google Scholar 

  3. Bauman, K.E.: The dilation factor of the Peano–Hilbert curve. Math. Notes 80(5), 609–620 (2006)

  4. Bauman, K.E.: One-sided Peano curves of fractal genus \(9\). Proc. Steklov Inst. Math. 275(1), 47–59 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bauman, K.E.: A lower bound for the square-linear ratio of regular Peano curves. Diskret. Mat. 25(4), 66–73 (2013). (in Russian)

  6. Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Amsterdam (2009)

    Google Scholar 

  7. Gotsman, C., Lindenbaum, M.: On the metric properties of discrete space-filling curves. IEEE Trans. Image Process. 5(5), 794–797 (1996)

    Article  Google Scholar 

  8. Haverkort, H.: An inventory of three-dimensional Hilbert space-filling curves (2011). arXiv:1109.2323

  9. Haverkort, H.: How many three-dimensional Hilbert curves are there? J. Comput. Geom. 8(1), 206–281 (2017)

    MathSciNet  MATH  Google Scholar 

  10. Haverkort, H., van Walderveen, F.: Locality and bounding-box quality of two-dimensional space-filling curves. Comput. Geom. 43(2), 131–147 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  11. Ignatiev, A., Morgado, A., Marques-Silva, J.: PySAT: a Python toolkit for prototyping with SAT oracles. In: 21st International Conference on Theory and Applications of Satisfiability Testing (Oxford 2018). Lecture Notes in Computer Science, vol. 10929, pp. 428–437. Springer, Cham (2018)

  12. Korneev, A.A., Shchepin, E.V.: \(L_\infty \)-locality of three-dimensional Peano curves. Proc. Steklov Inst. Math. 302(1), 217–249 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  13. Malykhin, Yu.V., Shchepin, E.V.: Minimal self-similar Peano curve of genus \(5\times 5\). Dokl. Math. 101(2), 135–138 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  14. Niedermeier, R., Reinhardt, K., Sanders, P.: Towards optimal locality in mesh-indexings. Discret. Appl. Math. 117(1–3), 211–237 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  15. Shchepin, E.V.: On fractal Peano curves. Proc. Steklov Inst. Math. 247(4), 272–280 (2004)

    MathSciNet  MATH  Google Scholar 

  16. Shchepin, E.V.: On Hölder maps of cubes. Math. Notes 87(5), 757–767 (2010)

    Article  MATH  Google Scholar 

  17. Shchepin, E.V.: On attainment of maximum cube-to-linear ratio for three-dimensional Peano curves. Math. Notes 98(6), 971–976 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  18. Shchepin, E.V., Bauman, K.E.: Minimal Peano curve. Proc. Steklov Inst. Math. 263(1), 236–256 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  19. Shchepin, E.V., Mychka, E.Yu.: Lower bounds for the square-to-linear ratio for plane Peano curves. Math. Notes 110(2), 267–272 (2021)

  20. Wierum, J.-M.: Definition of a new circular space-filling curve: \(\beta \Omega \)-indexing. Technical Report TR-001-02, Paderborn Center for Parallel Computing (2002)

Download references

Acknowledgements

The authors express their gratitude to the anonymous referee for his careful work and valuable suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yuri Malykhin.

Additional information

Editor in Charge: Kenneth Clarkson

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Malykhin, Y., Shchepin, E. Search of Fractal Space-Filling Curves with Minimal Dilation. Discrete Comput Geom 70, 189–213 (2023). https://doi.org/10.1007/s00454-022-00444-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00454-022-00444-2

Keywords

Mathematics Subject Classification

Navigation