Calculating the Number of Tunnels

Authors:
Fajie Li;Reinhard Klette
Affiliations:
Groningen University, The Netherlands;The University of Auckland, New Zealand
Venue:
CIARP '08 Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications
Year:
2008

Citing 3
Cited 0

An incremental algorithm for Betti numbers of simplicial complexes on the 3-spheres

Computer Aided Geometric Design - Special issue on grid generation, finite elements, and geometric design
Digital Geometry: Geometric Methods for Digital Picture Analysis

Digital Geometry: Geometric Methods for Digital Picture Analysis
Computation of homology groups and generators

DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers 2-regions of grid cubes and proposes an algorithm for calculating the number of tunnels of such a region. The graph-theoretical algorithm proceeds layer by layer; a proof of its correctness is provided, and its time complexity is also given.