On the number of 0-tandems in simple nD digital 0-connected curves

DOI10.1007/978-3-031-23612-9_3MaRDI QIDQ6166829zbMATH OpenOpenAlexFDO

Authors Lidija Čomić

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

zbMATH Keywords

critical configurationsdigital curvesdigital topologygapstandems

Mathematics Subject Classification ID

Computational aspects of digital topology (68U03)

Recommendations

• Combinatorial Relations for Digital Pictures
• On gaps in digital objects
• Formulas for the number of (n-2)-gaps of binary objects in arbitrary dimension
• Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD
• On the number of digital straight line segments

Cites work

• A formula for the number of (n - 2)-gaps in digital n-objects
• A note on dimension and gaps in digital geometry
• A tutorial on well-composedness
• Combinatorial Image Analysis
• Combinatorial Relations for Digital Pictures
• Combinatorial topologies for discrete planes.
• Formulas for the number of (n-2)-gaps of binary objects in arbitrary dimension
• GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION
• scientific article; zbMATH DE number 2129318 (Why is no real title available?)
• On 1-gaps in 3D digital objects
• On gaps in digital objects

Cited in

(2)

• About the Maximum Cardinality of the Digital Cover of a Curve with a Given Length
• Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD

This page was built for publication: On the number of 0-tandems in simple \(n\)D digital 0-connected curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166829)