An explicit formula for the number of tunnels in digital objects

Simple item page
dc.creatorBrimkov, Valentin
dc.creatorMaimone, Angelo
dc.creatorNordo, Giorgio
dc.date2005-05-31
dc.date2005-09-07
dc.date.accessioned2026-07-07T03:23:04Z
dc.date.available2026-07-07T03:23:04Z
dc.descriptionAn 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.
dc.description9 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/cs/0505084
dc.identifierhttp://arxiv.org/abs/cs/0505084
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32798
dc.subjectDiscrete Mathematics
dc.subjectComputational Geometry
dc.subjectComputer Vision and Pattern Recognition
dc.subjectG.2.1; F.2.2; I.4.6; I.5.1
dc.titleAn explicit formula for the number of tunnels in digital objects
dc.typetext

Files

Collections

arXiv