×

A novel approach to generating microstructurally-aware non-convex domains. (English) Zbl 1442.74149

Summary: We present a novel methodology for generating synthetic microstructures in non-convex domains. Simple techniques that include mapping, point identification, divide and map, clockwise and counter-clockwise ordering of vertices, approximate convex decomposition and stitching are proposed to realize tessellated non-convex geometries, both in two- and three-dimensions. A tessellated convex domain is used as a reference for mapping of either simply or multiply connected non-convex geometries that are difficult to generate through simple cut operations using geometric primitives. Subroutines are developed in MATLAB for mapping the tessellations. The developed routines are also capable of generating geometry files that allow in further discretization or meshing of the tessellated domain. We present several case studies in two- and three-dimensions to demonstrate the robustness of the tool developed and highlight the unique capabilities of the proposed methodology in handling non-convex internal and external boundaries of the domain to be mapped.

MSC:

74M25 Micromechanics of solids

Software:

OOF3D; DREAM.3D; Qhull; Neper; Gmsh
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Armstrong, R. W., 60 years of hall-petch: Past to present nano-scale connections, Mater. Trans., 55, 1, 2-12 (2014)
[2] (Rusty) Gray, G. T., High-strain-rate deformation: Mechanical behavior and deformation substructures induced, Annu. Rev. Mater. Res., 42, 1, 285-303 (2012)
[3] Sevillano, J. G.; van Houtte, P.; Aernoudt, E., Large strain work hardening and textures, Prog. Mater. Sci., 25, 2, 69-134 (1980)
[4] Hemker, K.; Sharpe, W., Microscale characterization of mechanical properties, Annu. Rev. Mater. Res., 37, 1, 93-126 (2007)
[5] Quey, R.; Dawson, P.; Barbe, F., Large-scale 3D random polycrystals for the finite element method: Generation, meshing and remeshing, Comput. Methods Appl. Mech. Engrg., 200, 17, 1729-1745 (2011) · Zbl 1228.74093
[6] Groeber, M. A.; Jackson, M. A., Dream.3D: A digital representation environment for the analysis of microstructure in 3D, Integr. Mater. Manuf. Innov., 3, 1, 56-72 (2014)
[7] Coffman, V. R.; Reid, A. C.; Langer, S. A.; Dogan, G., OOF3D: An image-based finite element solver for materials science, Math. Comput. Simulation, 82, 12, 2951-2961 (2012)
[8] Quey, R.; Renversade, L., Optimal polyhedral description of 3D polycrystals: Method and application to statistical and synchrotron X-ray diffraction data, Comput. Methods Appl. Mech. Engrg., 330, 308-333 (2018) · Zbl 1439.74087
[9] Selvarajou, B.; Joshi, S. P.; Benzerga, A. A., Void growth and coalescence in hexagonal close packed crystals, J. Mech. Phys. Solids, 125, 198-224 (2019)
[10] Lloyd, J.; Matejunas, A.; Becker, R.; Walter, T.; Priddy, M.; Kimberley, J., Dynamic tensile failure of rolled magnesium: Simulations and experiments quantifying the role of texture and second-phase particles, Int. J. Plast., 114, 174-195 (2019)
[11] Selvarajou, B.; Kondori, B.; Benzerga, A. A.; Joshi, S. P., On plastic flow in notched hexagonal close packed single crystals, J. Mech. Phys. Solids, 94, 273-297 (2016)
[12] Selvarajou, B.; Joshi, S. P.; Benzerga, A. A., Three dimensional simulations of texture and triaxiality effects on the plasticity of magnesium alloys, Acta Mater., 127, 54-72 (2017)
[13] Kondori, B.; Benzerga, A. A., Effect of stress triaxiality on the flow and fracture of mg alloy AZ31, Metall. Mater. Trans. A, 45, 8, 3292-3307 (2014)
[14] Falco, S.; Siegkas, P.; Barbieri, E.; Petrinic, N., A new method for the generation of arbitrarily shaped 3D random polycrystalline domains, Comput. Mech., 54, 6, 1447-1460 (2014) · Zbl 1309.74058
[15] 9.5.0.944444 (R2018b) (2018), The MathWorks Inc.: The MathWorks Inc. Natick, Massachusetts
[16] Geuzaine, C.; Remacle, J.-F., Gmsh: A 3-D finite element mesh generator with built-in pre- and post-processing facilities, Internat. J. Numer. Methods Engrg., 79, 11, 1309-1331 (2009) · Zbl 1176.74181
[17] Barber, C. B.; Dobkin, D. P.; Huhdanpaa, H., The quickhull algorithm for convex hulls, ACM Trans. Math. Software, 22, 4, 469-483 (1996) · Zbl 0884.65145
[18] Preparata, F. P.; Shamos, M., Computational Geometry (1985), Springer-Verlag: Springer-Verlag New York · Zbl 0759.68037
[19] Wakai, F.; Enomoto, N.; Ogawa, H., Three-dimensional microstructural evolution in ideal grain growth—general statistics, Acta Mater., 48, 6, 1297-1311 (2000)
[20] Barbe, F.; Quey, R., A numerical modelling of 3D polycrystal-to-polycrystal diffusive phase transformations involving crystal plasticity, Int. J. Plast., 27, 6, 823-840 (2011) · Zbl 1453.74069
[21] Okabe, A.; Boots, B.; Sugihara, K., Spatial Tessellations: Concepts and Applications of Voronoi Diagrams (1992), John Wiley & Sons, Inc.: John Wiley & Sons, Inc. New York, NY, USA · Zbl 0877.52010
[22] Quey, R., Neper (3.5.0) (2019), http://neper.sourceforge.net
[23] Holcombe, S., Inpolyhedron - Are Points Inside a Triangulated Volume? (3.3.0.0) (2015), MATLAB Central File Exchange
[24] D’Errico, J., Inhull (2019), MATLAB Central File Exchange
[25] Kleder, M., VERT2CON - Vertices to Constraints (1.0.0.0) (2005), MATLAB Central File Exchange
[26] Matt, J., Analyze N-dimensional Polyhedra in Terms of Vertices or (In)Equalities (1.9.0.0) (2017), MATLAB Central File Exchange
[27] Giaccari, L., Surface Reconstruction from Scattered Points Cloud (Open Surfaces) (1.0.0.0) (2017), MATLAB Central File Exchange
[28] Mammou, K., Volumetric hierarchical approximate convex decomposition, (Game Engine Gems 3 (2016), A K Peters/CRC Press), 141-158
[29] Mamou, K.; Ghorbel, F., A simple and efficient approach for 3D mesh approximate convex decomposition, (2009 16th IEEE International Conference on Image Processing (ICIP) (2009)), 3501-3504
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.