Patch Iteration
Robert P. Munafo, 2023 Jun 18.
"Patch iteration" is a subclass of the perturbation methods, in which a set of pixels (usually a rectangular grid) is iterated using key points on the corners and/or edges of the grid. As with any perturbation method, the key points are computed at full precision. The rest of the points are computed by interpolating between the known iterates of the key points.
The original type of patch iteration was the synchronous orbit method used in Fractal Witchcraft (1992).
By 1997, quadratic interpolation was being used in the program "AlmondBread".
Because it uses interpolation only, patch iteration differs from the perturbation methods that use extrapolation, such as cubic deltas.
From the Mandelbrot Set Glossary and Encyclopedia, by Robert Munafo, (c) 1987-2024.
Mu-ency main page — index — recent changes — DEMZ
This page was written in the "embarrassingly readable" markup language RHTF, and was last updated on 2023 Jun 27.
s.27