Fractal interpolation surfaces derived from fractal interpolation functions (Q2381913)

The paper presents a new construction of fractal interpolation surfaces based on the construction of fractal interpolation functions and proves some of their interesting properties. With the use of fractal interpolation functions, fractal interpolation surfaces are constructed as graphs of continuous functions on arbitrary data points placed on rectangular grids. This construction enables the control of the box dimension of the fractal surface, giving a lower bound of it, independently of the interpolation points. A fractal interpolation surfaces may be produced as rough as desired. The paper starts with a brief introduction followed by a detailed description of the mathematical background of hyperbolic iterated function systems, recurrent iterated function systems and fractal interpolation functions together with a lemma concerning the stability of fractal interpolation functions. The next section is devoted to the new construction of fractal interpolation surfaces on a rectangular grid of arbitrary interpolation points, using fractal interpolation functions. It is proved that the constructed surface is the graph of a continuous function. In the last section a general result is proved that gives a lower bound for the box-counting dimension \(\underline{\dim}_B(G_F)\) of the graph \(G_F\) of a continuous function \(F: [0,1]\times[0,1] \mapsto\mathbb R,\) if a lower bound of the box-counting dimension \(\underline{\dim}_B(G_{F_y})\) of its plane sections \(G_{F_y}\) is known, where \(F_y\) denotes a restriction of \(F\) on \([0,1]\times\{y\},\) \(y\in[0,p]:\) If \(\underline{\dim}_B(G_{F_y})\geq s\) for almost all \(y\in[0,p],\) then~\(\underline{\dim}_B(G_F)\geq s+1.\) The authors also remark that the construction presented in the paper can be generalized in order to construct fractal interpolation functions defined on \([0,1]^n,\) \(n\in\mathbb N,\) that interpolate arbitrary data (placed in rectangular grids).