An explicit formula for the number of tunnels in digital objects

05/31/2005
by   Valentin Brimkov, et al.
0

An important concept in digital geometry for computer imagery is that of tunnel. In this paper we obtain a formula for the number of tunnels as a function of the number of the object vertices, pixels, holes, connected components, and 2x2 grid squares. It can be used to test for tunnel-freedom a digital object, in particular a digital curve.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/16/2021

0-Gaps on 3D Digital Curves

In Digital Geometry, gaps are some basic portion of a digital object tha...
research
04/24/2019

CLT for non-Hermitian random band matrices with variance profiles

We show that the fluctuations of the linear eigenvalue statistics of a n...
research
10/30/2018

The 2-domination and Roman domination numbers of grid graphs

We investigate the 2-domination number for grid graphs, that is the size...
research
05/06/2022

Optimal Bounds for Weak Consistent Digital Rays in 2D

Representation of Euclidean objects in a digital space has been a focus ...
research
07/06/2018

Digital Geometry, a Survey

This paper provides an overview of modern digital geometry and topology ...
research
06/08/2018

The Saturated Subpaths Decomposition in Z 2 : a short note on generalized Tangential Cover

In this short note, we generalized the Tangential Cover used in Digital ...
research
03/22/2018

Update Thresholds of More Accurate Time Stamp for Event Reconstruction

Many systems rely on reliable timestamps to determine the time of a part...

Please sign up or login with your details

Forgot password? Click here to reset