Combinatorial Image Analysis
From MaRDI portal
Publication:5465734
DOI10.1007/b103936zbMath1113.68571DBLPconf/iwcia/2004OpenAlexW4298251703WikidataQ57919644 ScholiaQ57919644MaRDI QIDQ5465734
Valentin E. Brimkov, Reinhard Klette
Publication date: 12 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b103936
Related Items (6)
Digital planarity -- a review ⋮ On the number of 0-tandems in simple \(n\)D digital 0-connected curves ⋮ Persistent homology of graph-like digital images ⋮ Galois connections between sets of paths and closure operators in simple graphs ⋮ Formulas for the number of \((n-2)\)-gaps of binary objects in arbitrary dimension ⋮ Universal Spaces for $(k, \overline{k})-$ Surfaces
This page was built for publication: Combinatorial Image Analysis