Publication detail

Structuring digital plane by the 8-adjacency graph with a set of walks

ŠLAPAL, J.

English title

Structuring digital plane by the 8-adjacency graph with a set of walks

Type

journal article - other

Language

en

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.

English 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 in English

Digital plane, 8-adjacency graph, walk, connectedness, Jordan curve theorem

Released

16.11.2017

Publisher

International Assocoation for Research and Science

Location

USA

ISSN

2367-895X

Volume

2017

Number

2

Pages from–to

150–154

Pages count

5

BIBTEX


@article{BUT155735,
  author="Josef {Šlapal},
  title="Structuring digital plane by the 8-adjacency graph with a set of walks",
  year="2017",
  volume="2017",
  number="2",
  month="November",
  pages="150--154",
  publisher="International Assocoation for Research and Science",
  address="USA",
  issn="2367-895X"
}