Covers of fractal interpolation surfaces with finite families of octahedrons

Abstract

In our previous work, On the localization of Hutchinson-Barnsley fractals, Chaos Solitons Fractals, 173 (2023), 113-674, we presented a method for finding a finite family of closed balls whose union contains the attractor of a given iterated function system. In this paper, for the particular framework of fractal interpolation surfaces, we provide an improved version of it. This approach is more efficient, from the computational point of view, as it is based on finding the maximum of certain sets, in contrast to the previous method which uses a sorting algorithm.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…