Publication detail

A convenient graph connectedness for digital imagery

ŠLAPAL, J.

Original Title

A convenient graph connectedness for digital imagery

Type

conference paper

Language

English

Original Abstract

In a simple undirected graph, we introduce a special connectedness induced by a set of paths of length 2. We focus on the 8-adjacency graph (with the vertex set Z^2) and study the connectedness induced by a certain set of paths of length 2 in the graph. For this connectedness, we prove a digital Jordan curve theorem by determining the Jordan curves, i.e., the circles in the graph that separate  Z^2 into exactly two connected components.

Keywords

Simple undirected graph, connectedness, digital plane, Khalimsky topology, Jordan curve theorem.

Authors

ŠLAPAL, J.

Released

1. 1. 2021

Publisher

Springer International Publishing

Location

Cham

ISBN

978-3-030-67076-4

Book

High Performance Computing in Science and Engineering 2019

Edition

Lecture Notes in Computer Science

ISBN

0302-9743

Periodical

Lecture Notes in Computer Science

Year of study

2021

Number

12456

State

Federal Republic of Germany

Pages from

150

Pages to

162

Pages count

13

URL

https://www.springer.com/gp/book/9783030670764

BibTex

@inproceedings{BUT168483,
  author="Josef {Šlapal}",
  title="A convenient graph connectedness for digital imagery",
  booktitle="High Performance Computing in Science and Engineering 2019",
  year="2021",
  series="Lecture Notes in Computer Science",
  journal="Lecture Notes in Computer Science",
  volume="2021",
  number="12456",
  pages="150--162",
  publisher="Springer International Publishing",
  address="Cham",
  doi="10.1007/978-3-030-67077-1\{_}9",
  isbn="978-3-030-67076-4",
  issn="0302-9743",
  url="https://www.springer.com/gp/book/9783030670764"
}

Documents

HPCSE2019rev.pdf