On the number of 0-tandems in simple \(n\)D digital 0-connected curves
From MaRDI portal
Publication:6166829
DOI10.1007/978-3-031-23612-9_3zbMath1525.68186OpenAlexW4313444861MaRDI QIDQ6166829
Publication date: 3 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-23612-9_3
Cites Work
- Unnamed Item
- Formulas for the number of \((n-2)\)-gaps of binary objects in arbitrary dimension
- A tutorial on well-composedness
- On 1-gaps in 3D digital objects
- A note on dimension and gaps in digital geometry
- A formula for the number of (n - 2)-gaps in digital n-objects
- GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION
- Combinatorial Relations for Digital Pictures
- Combinatorial Image Analysis
- Discrete Geometry for Computer Imagery
- On gaps in digital objects
This page was built for publication: On the number of 0-tandems in simple \(n\)D digital 0-connected curves