Polyhedral Representation and Adjacency Graph in n-dimensional Digital Images
From MaRDI portal
Recommendations
Cited in
(14)- Digital pseudomanifolds, digital weakmanifolds and Jordan--Brouwer separation theorem
- Dimensional properties of graphs and digital spaces.
- Parallel homological calculus for 3D binary digital images
- scientific article; zbMATH DE number 2045904 (Why is no real title available?)
- GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION
- scientific article; zbMATH DE number 2079714 (Why is no real title available?)
- Combinatorics on Adjacency Graphs and Incidence Pseudographs
- Generating cubical complexes from image data and computation of the Euler number
- A convenient graph connectedness for digital imagery
- Labeling of \(n\)-dimensional images with choosable adjacency of the pixels
- Determining the components of the complement of a digital \((n-1)\)-manifold in \(\mathbb{Z}^n\)
- scientific article; zbMATH DE number 1737977 (Why is no real title available?)
- Adjacencies for Structuring the Digital Plane
- Alternate product adjacencies in digital topology
This page was built for publication: Polyhedral Representation and Adjacency Graph in n-dimensional Digital Images
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4798313)