GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION
From MaRDI portal
Recommendations
- A Genus Bound for Digital Image Boundaries
- Polyhedral Representation and Adjacency Graph in n-dimensional Digital Images
- scientific article; zbMATH DE number 2063782
- scientific article; zbMATH DE number 4074512
- The topology of digital images
- Topological Complexities of Finite Digital Images
- Digital geometry algorithms. Theoretical foundations and applications to computational imaging
- Applications of the Lefschetz number to digital images
Cites work
- A fast algorithm to calculate the Euler number for binary images
- Asymptotically efficient in-place merging
- Connectivity in Digital Pictures
- Formulas for the number of (n-2)-gaps of binary objects in arbitrary dimension
- scientific article; zbMATH DE number 2129318 (Why is no real title available?)
- scientific article; zbMATH DE number 3902440 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- In-place sorting with fewer moves
- Object discretizations in higher dimensions
- On the Topological Properties of Quantized Spaces, I. The Notion of Dimension
- Sorting multisets stably in minimum space
Cited in
(7)- The genus of a digital image boundary is determined by its foreground, background, and Reeb graphs
- A note on dimension and gaps in digital geometry
- Mappings on abstract cellular complex and their applications in image analysis
- A Genus Bound for Digital Image Boundaries
- On the number of 0-tandems in simple \(n\)D digital 0-connected curves
- A note on 0-gaps in 3D digital curves
- Digital topological method for computing genus and the Betti numbers
This page was built for publication: GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5305546)