A computational geometry approach to pore network construction for granular packings. (March 2018)

• Record Type: Journal Article
• Authors: van der Linden, Joost H.; Sufian, Adnan; Narsilio, Guillermo A.; Russell, Adrian R.; Tordesillas, Antoinette
• Is Part Of: Computers & geosciences. Volume 112(2018)
• Page Start: 133
• Page End: 143
• Publication Date: 2018-03
• Subjects: Pore network -- Delaunay triangulation -- Fluid flow -- Computational geometry; 00-01 -- 99-00; Environmental policy -- Periodicals; 550.5
• DOI: 10.1016/j.cageo.2017.12.004
• Languages: English
• ISSNs: 0098-3004

Abstract

Abstract: Pore network construction provides the ability to characterize and study the pore space of inhomogeneous and geometrically complex granular media in a range of scientific and engineering applications. Various approaches to the construction have been proposed, however subtle implementational details are frequently omitted, open access to source code is limited, and few studies compare multiple algorithms in the context of a specific application. This study presents, in detail, a new pore network construction algorithm, and provides a comprehensive comparison with two other, well-established Delaunay triangulation-based pore network construction methods. Source code is provided to encourage further development. The proposed algorithm avoids the expensive non-linear optimization procedure in existing Delaunay approaches, and is robust in the presence of polydispersity. Algorithms are compared in terms of structural, geometrical and advanced connectivity parameters, focusing on the application of fluid flow characteristics. Sensitivity of the various networks to permeability is assessed through network (Stokes) simulations and finite-element (Navier-Stokes) simulations. Results highlight strong dependencies of pore volume, pore connectivity, throat geometry and fluid conductance on the degree of tetrahedra merging and the specific characteristics of the throats targeted by the merging algorithm. The paper concludes with practical recommendations on the applicability of the three investigated algorithms.