Detail výsledku

Graphs with a path partition for structuring the digital plane

ŠLAPAL, J. Graphs with a path partition for structuring the digital plane. INFORMATION SCIENCES, 2013, vol. 233, no. 1, p. 305-312. ISSN: 0020-0255.
Typ
článek v časopise
Jazyk
anglicky
Autoři
Šlapal Josef, prof. RNDr., CSc., DFSI (FSI), ÚM (FSI)
Abstrakt

We introduce the concept of graphs with a path partition
and define a special type of connectedness in these graphs. The
connectedness is shown to have certain properties suitable for using
graphs with a path partition as convenient background structures on
digital spaces for the study of digital images. We introduce a
family of such graphs on the integer plane and present a Jordan curve
theorem for them.

Klíčová slova

Graph with a path partition, arc, Jordan curve, digital plane

Rok
2013
Strany
305–312
Časopis
INFORMATION SCIENCES, roč. 233, č. 1, ISSN 0020-0255
BibTeX 
@article{BUT97401,
  author="Josef {Šlapal}",
  title="Graphs with a path partition for structuring the digital plane",
  journal="INFORMATION SCIENCES",
  year="2013",
  volume="233",
  number="1",
  pages="305--312",
  issn="0020-0255"
}
Projekty
Centrum excelence IT4Innovations, MŠMT, Operační program Výzkum a vývoj pro inovace, ED1.1.00/02.0070, zahájení: 2011-01-01, ukončení: 2015-12-31, ukončen
Pracoviště
Ústav matematiky (ÚM)
Nahoru