Publication detail
Structuring digital plane by the 8-adjacency graph with a set of walks
ŠLAPAL, J.
Original Title
Structuring digital plane by the 8-adjacency graph with a set of walks
Type
journal article - other
Language
English
Original Abstract
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.
Keywords
Digital plane, 8-adjacency graph, walk, connectedness, Jordan curve theorem
Authors
ŠLAPAL, J.
Released
16. 11. 2017
Publisher
International Assocoation for Research and Science
Location
USA
ISBN
2367-895X
Periodical
International Journal of Mathematical and Computational Methods
Year of study
2017
Number
2
State
United States of America
Pages from
150
Pages to
154
Pages count
5
URL
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"
}