Convenient adjacencies for structuring the digital plane

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F15%3APU107350" target="_blank" >RIV/00216305:26210/15:PU107350 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/s10472-013-9394-2" target="_blank" >http://dx.doi.org/10.1007/s10472-013-9394-2</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s10472-013-9394-2" target="_blank" >10.1007/s10472-013-9394-2</a>

Result language

angličtina

Original language name

Convenient adjacencies for structuring the digital plane

Original language description

We study graphs with the vertex set Z^2 which are subgraphs of the 8- adjacency graph and have the property that certain natural cycles in these graphs are Jordan curves, i.e., separate Z^2 into exactly two connected components. Of these graphs, we determine the minimal ones and study their quotient graphs. The results obtained are used to prove digital analogues of the Jordan curve theorem for several graphs on Z^2. Thus, these graphs are shown to provide background structures on the digital plane Z^2 convenient for studying digital images.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10101 - Pure mathematics

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2015

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE

ISSN

1012-2443

e-ISSN

1573-7470

Volume of the periodical

75 (2015)

Issue of the periodical within the volume

1

Country of publishing house

CH - SWITZERLAND

Number of pages

10

Pages from-to

69-88

UT code for WoS article

000361450200005

EID of the result in the Scopus database

2-s2.0-84941926544