A convenient graph connectedness for digital imagery
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F21%3APU138870" target="_blank" >RIV/00216305:26230/21:PU138870 - isvavai.cz</a>
Result on the web
<a href="https://www.springer.com/gp/book/9783030670764" target="_blank" >https://www.springer.com/gp/book/9783030670764</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-67077-1_9" target="_blank" >10.1007/978-3-030-67077-1_9</a>
Alternative languages
Result language
angličtina
Original language name
A convenient graph connectedness for digital imagery
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/LQ1602" target="_blank" >LQ1602: IT4Innovations excellence in science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2021
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
Article name in the collection
High Performance Computing in Science and Engineering 2019
ISBN
978-3-030-67076-4
ISSN
0302-9743
e-ISSN
—
Number of pages
13
Pages from-to
150-162
Publisher name
Springer International Publishing
Place of publication
Cham
Event location
Hotel Soláň
Event date
May 20, 2019
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—