Structuring digital plane by the 8-adjacency graph with a set of walks
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F17%3APU131261" target="_blank" >RIV/00216305:26210/17:PU131261 - isvavai.cz</a>
Result on the web
<a href="https://www.iaras.org/iaras/home/caijmcm/structuring-digital-plane-by-the-8-adjacency-graph-with-a-set-of-walks" target="_blank" >https://www.iaras.org/iaras/home/caijmcm/structuring-digital-plane-by-the-8-adjacency-graph-with-a-set-of-walks</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Structuring digital plane by the 8-adjacency graph with a set of walks
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>ost</sub> - Miscellaneous article in a specialist periodical
CEP classification
—
OECD FORD branch
10102 - Applied mathematics
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
International Journal of Mathematical and Computational Methods
ISSN
2367-895X
e-ISSN
—
Volume of the periodical
2017
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
5
Pages from-to
150-154
UT code for WoS article
—
EID of the result in the Scopus database
—