Algorithms for generating planar networks simulating hierarchical patterns of cracks formed during film drying
Yuri Yu. Tarasevich, Andrei V. Eserkepov, Andrei S. Burmistrov

TL;DR
This paper develops algorithms to generate and analyze hierarchical crack networks in drying films, comparing real and simulated patterns to improve understanding of crack formation.
Contribution
It introduces three novel methods for generating artificial hierarchical crack networks and compares their effectiveness with real-world patterns.
Findings
Simulation model best reproduces real crack features
Crack networks exhibit hierarchical and right-angled connection patterns
Analysis reveals limitations of existing classification methods
Abstract
Hierarchical crack patterns that arise during the drying of thin films of colloidal dispersions or polymer solutions on a solid substrate are of interest both from a fundamental standpoint and in the context of the creation of transparent electrodes for optoelectronics. This paper analyzes the morphology of such patterns based on image processing of real-world samples. Graph theory is used to extract chains of edges and analyze the network topology. A method based on the hierarchy of connections is applied to classify cracks by generation. The limitations of existing classification approaches related to the discreteness of the time scale and the use of only a part of the entire pattern are discussed. Three approaches are used to generate artificial hierarchical networks: random uniform partitioning, recursive Voronoi partitioning, and a crack growth simulation model, each modified to…
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.
Taxonomy
TopicsNanomaterials and Printing Technologies · Fluid Dynamics and Thin Films · Numerical methods in engineering
