Connectivity calculus of fractal polyhedrons
From MaRDI portal
Publication:1678685
DOI10.1016/j.patcog.2014.05.016zbMath1374.68668OpenAlexW1976920304WikidataQ59388589 ScholiaQ59388589MaRDI QIDQ1678685
Reinhard Klette, Helena Molina-Abril, Akira Nakamura, Pedro Real
Publication date: 20 November 2017
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/handle/11441/38716
cyclesconnectivitydirected graphsBetti numberfractal settopological analysistunnelsMenger spongeSierpiński pyramid
Related Items (3)
Parallel homological calculus for 3D binary digital images ⋮ Fractal topological analysis for 2D binary digital images ⋮ Searching combinatorial optimality using graph-based homology information
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perturbation theory in differential homological algebra. I
- The computability problem in algebraic topology
- Morse theory for cell complexes
- Computational homology
- Computing connectedness: disconnectedness and discreteness.
- On the cohomology of 3D digital images
- Homological spanning forest framework for 2D image analysis
- Computation of cubical homology, cohomology, and (co)homological operations via chain contraction
- On the groups \(H(\Pi,n)\). I
- DETERMINATION OF FRACTAL SCALES ON TRABECULAR BONE X-RAY IMAGES
- A Fixed Point Approach to Homological Perturbation Theory
- Computing connectedness: An exercise in computational topology
- Computer Algebra in Scientific Computing
This page was built for publication: Connectivity calculus of fractal polyhedrons