Abstract
The paper presents an original algorithm for reducing three-dimensional digital images to improve the computing performance of persistence diagrams. These diagrams represent changes in pore space topology during essential or artificial changes in the structure of porous materials. The algorithm has linear complexity because during reduction, each voxel is checked not more than seven times. This check, as well as the removal of voxels, takes a constant number of operations. We illustrate that the algorithm’s efficiency depends on the complexity of the original pore space and the size of filtration steps. The application of the reduction algorithm allows the computation of one-dimensional persistence Betti numbers for models of up to 5003 voxels by using a single computational node. Thus, it can be used for routine topological analysis and the topological optimization of porous materials.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
