Convex polygon packing based meshing algorithm for modeling of rock and porous media
- Post by: alejandro
- June 30, 2020
- Comments off
In: Krzhizhanovskaya V. et al. (eds) Computational Science – ICCS 2020. ICCS 2020.
Lecture Notes in Computer Science, vol 12141. Springer, Cham
In this work, we propose new packing algorithm designed for the generation of polygon meshes to be used for modeling of rock and porous media based on the virtual element method. The packing problem to be solved corresponds to a two-dimensional packing of convex-shape polygons and is based on the locus operation used for the advancing front approach. Additionally, for the sake of simplicity, we decided to restrain the polygon rotation in the packing process. Three heuristics are presented to simplify the packing problem: density heuristic, gravity heuristic and the multi-layer packing. The decision made by those three heuristic are prioritizing on minimizing the area, inserting polygons on the minimum Y coordinate and pack polygons in multiple layers dividing the input in multiple lists, respectively. Finally, we illustrate the potential of the generated meshes by solving a diffusion problem, where the discretized domain consisted in polygons and spaces with different conductivities. Due to the arbitrary shape of polygons and spaces that are generated by the packing algorithm, the virtual element method was used to solve the diffusion problem numerically.
Keywords: polygonal meshes, geometric packing, virtual element method, computational geometry
Original Journal Article: https://doi.org/10.1007/978-3-030-50426-7_20