Detail publikace
Structuring digital plane by the 8-adjacency graph with a set of walks
ŠLAPAL, J.
Anglický název
Structuring digital plane by the 8-adjacency graph with a set of walks
Typ
Článek recenzovaný mimo WoS a Scopus
Jazyk
en
Originální abstrakt
In the digital plane Z^2, we define connectedness induced by a set of walks of the same lengths in the 8-adjacency graph. The connectedness is shown to satisfy a digital analogue of the Jordan curve theorem. This proves that the 8-adjacency graph with a set of walks of the same lengths provides a convenient structure on the digital plane Z^2 for the study of digital images.
Klíčová slova anglicky
Digital plane, 8-adjacency graph, walk, connectedness, Jordan curve theorem
Vydáno
2017-11-16
Nakladatel
International Assocoation for Research and Science
Místo
USA
ISSN
2367-895X
Časopis
International Journal of Mathematical and Computational Methods
Ročník
2017
Číslo
2
Strany od–do
150–154
Počet stran
5
BIBTEX
@article{BUT155735,
author="Josef {Šlapal}",
title="Structuring digital plane by the 8-adjacency graph with a set of walks",
journal="International Journal of Mathematical and Computational Methods",
year="2017",
volume="2017",
number="2",
pages="150--154",
issn="2367-895X",
url="https://www.iaras.org/iaras/home/caijmcm/structuring-digital-plane-by-the-8-adjacency-graph-with-a-set-of-walks"
}