Abstract

The microstructures of a composite determine its macroscopic properties. In this study, microstructures with particles of arbitrary shapes and sizes are constructed by using several developed fractal geometry algorithms implemented in MATLAB. A two-dimensional (2D) quadrilateral fractal geometry algorithm is developed based on the modified Sierpinski carpet algorithm. Square-, rectangle-, circle-, and ellipse-based microstructure constructions are special cases of the 2D quadrilateral fractal geometry algorithm. Moreover, a three-dimensional (3D) random hexahedron geometry algorithm is developed according to the Menger sponge algorithm. Cube- and sphere-based microstructure constructions are special cases of the 3D hexahedron fractal geometry algorithm. The polydispersities of fractal shapes and random fractal sub-units demonstrate significant enhancements compared to those obtained by the original algorithms. In addition, the 2D and 3D algorithms mentioned in this article can be combined according to the actual microstructures. The verification results also demonstrate the practicability of these algorithms. The developed algorithms open up new avenues for the constructions of microstructures, which can be embedded into commercial finite element method softwares.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call