New Algorithm for Parallel Laplacian Growth by Iterated Conformal Maps
Anders Levermann (1,2), Itamar Procaccia (1) ((1) Weizmann, Institute, Rehovot, Israel, (2) Potsdam Institute of Climate Impact Research,, Germany)

TL;DR
This paper introduces a novel algorithm that uses iterated conformal maps to generate Laplacian growth patterns, effectively overcoming previous challenges and enabling detailed analysis of fractal properties.
Contribution
The paper presents a new algorithm for Laplacian growth using iterated conformal maps, improving pattern generation and analysis capabilities.
Findings
Growth patterns are comparable to those from numerical solutions.
Fractal dimension of patterns is analyzed.
Algorithm effectively overcomes growth layer challenges.
Abstract
We report a new algorithm to generate Laplacian Growth Patterns using iterated conformal maps. The difficulty of growing a complete layer with local width proportional to the gradient of the Laplacian field is overcome. The resulting growth patterns are compared to those obtained by the best algorithms of direct numerical solutions. The fractal dimension of the patterns is discussed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
