Skip to main content

2020 | OriginalPaper | Buchkapitel

Convex Polygon Packing Based Meshing Algorithm for Modeling of Rock and Porous Media

verfasst von : Joaquí­n Torres, Nancy Hitschfeld, Rafael O. Ruiz, Alejandro Ortiz-Bernardin

Erschienen in: Computational Science – ICCS 2020

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Agarwal, P.K., Flato, E., Halperin, D.: Polygon decomposition for efficient construction of Minkowski sums. Comput. Geom. 21(1–2), 39–61 (2002)MathSciNetCrossRef Agarwal, P.K., Flato, E., Halperin, D.: Polygon decomposition for efficient construction of Minkowski sums. Comput. Geom. 21(1–2), 39–61 (2002)MathSciNetCrossRef
2.
Zurück zum Zitat Berkey, J.O., Wang, P.Y.: Two-dimensional finite bin-packing algorithms. J. Oper. Res. Soc. 38(5), 423–429 (1987)CrossRef Berkey, J.O., Wang, P.Y.: Two-dimensional finite bin-packing algorithms. J. Oper. Res. Soc. 38(5), 423–429 (1987)CrossRef
4.
Zurück zum Zitat Feng, Y., Han, K., Owen, D.: An advancing front packing of polygons, ellipses and spheres. In: Discrete Element Methods: Numerical Modeling of Discontinua, pp. 93–98. ASCE Library (2002) Feng, Y., Han, K., Owen, D.: An advancing front packing of polygons, ellipses and spheres. In: Discrete Element Methods: Numerical Modeling of Discontinua, pp. 93–98. ASCE Library (2002)
5.
Zurück zum Zitat Feng, Y., Han, K., Owen, D.: Filling domains with disks: an advancing front approach. Int. J. Numer. Meth. Eng. 56(5), 699–713 (2003)CrossRef Feng, Y., Han, K., Owen, D.: Filling domains with disks: an advancing front approach. Int. J. Numer. Meth. Eng. 56(5), 699–713 (2003)CrossRef
6.
Zurück zum Zitat Hopper, E., Turton, B.C.: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. Eur. J. Oper. Res. 128(1), 34–57 (2001)CrossRef Hopper, E., Turton, B.C.: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. Eur. J. Oper. Res. 128(1), 34–57 (2001)CrossRef
7.
Zurück zum Zitat Huang, W., Chen, D., Xu, R.: A new heuristic algorithm for rectangle packing. Comput. Oper. Res. 34(11), 3270–3280 (2007)MathSciNetCrossRef Huang, W., Chen, D., Xu, R.: A new heuristic algorithm for rectangle packing. Comput. Oper. Res. 34(11), 3270–3280 (2007)MathSciNetCrossRef
9.
Zurück zum Zitat Löhner, R., Oñate, E.: An advancing front technique for filling space with arbitrary separated objects. Int. J. Numer. Meth. Eng. 78(13), 1618–1630 (2009)MathSciNetCrossRef Löhner, R., Oñate, E.: An advancing front technique for filling space with arbitrary separated objects. Int. J. Numer. Meth. Eng. 78(13), 1618–1630 (2009)MathSciNetCrossRef
11.
Zurück zum Zitat Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. Wiley Series in Probability and Statistics, 2nd edn. Wiley (2009) Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. Wiley Series in Probability and Statistics, 2nd edn. Wiley (2009)
12.
Zurück zum Zitat Ortiz-Bernardin, A., Alvarez, C., Hitschfeld-Kahler, N., Russo, A., Silva-Valenzuela, R., Olate-Sanzana, E.: Veamy: an extensible object-oriented C++ library for the virtual element method. Numer. Algorithms 82, 1–32 (2018) Ortiz-Bernardin, A., Alvarez, C., Hitschfeld-Kahler, N., Russo, A., Silva-Valenzuela, R., Olate-Sanzana, E.: Veamy: an extensible object-oriented C++ library for the virtual element method. Numer. Algorithms 82, 1–32 (2018)
14.
Zurück zum Zitat Shimrat, M.: Algorithm 112: position of point relative to polygon. Commun. ACM 5(8), 434–435 (1962)CrossRef Shimrat, M.: Algorithm 112: position of point relative to polygon. Commun. ACM 5(8), 434–435 (1962)CrossRef
15.
Zurück zum Zitat da Veiga, B.L., Brezzi, F., Cangiani, A., Manzini, G., Marini, L.D., Russo, A.: Basic principles of virtual element methods. Math. Models Methods Appl. Sci. 23(01), 199–214 (2013)MathSciNetCrossRef da Veiga, B.L., Brezzi, F., Cangiani, A., Manzini, G., Marini, L.D., Russo, A.: Basic principles of virtual element methods. Math. Models Methods Appl. Sci. 23(01), 199–214 (2013)MathSciNetCrossRef
16.
17.
Zurück zum Zitat Žalik, B.: Two efficient algorithms for determining intersection points between simple polygons. Comput. Geosci. 26(2), 137–151 (2000)CrossRef Žalik, B.: Two efficient algorithms for determining intersection points between simple polygons. Comput. Geosci. 26(2), 137–151 (2000)CrossRef
Metadaten
Titel
Convex Polygon Packing Based Meshing Algorithm for Modeling of Rock and Porous Media
verfasst von
Joaquí­n Torres
Nancy Hitschfeld
Rafael O. Ruiz
Alejandro Ortiz-Bernardin
Copyright-Jahr
2020
DOI
https://doi.org/10.1007/978-3-030-50426-7_20