Polyhedral Representation and Adjacency Graph in n-dimensional Digital Images
DOI10.1006/CVIU.2000.0859zbMATH Open1010.68547OpenAlexW2024909582MaRDI QIDQ4798313FDOQ4798313
Authors: Mohammed Khachan, Patrick Chenin, Hafsa Deddi 
Publication date: 19 March 2003
Published in: Computer Vision and Image Understanding (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/cviu.2000.0859
Recommendations
Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Machine vision and scene understanding (68T45)
Cited In (14)
- Determining the components of the complement of a digital \((n-1)\)-manifold in \(\mathbb{Z}^n\)
- Title not available (Why is that?)
- Parallel homological calculus for 3D binary digital images
- Combinatorics on Adjacency Graphs and Incidence Pseudographs
- Title not available (Why is that?)
- Dimensional properties of graphs and digital spaces.
- Title not available (Why is that?)
- Labeling of \(n\)-dimensional images with choosable adjacency of the pixels
- GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION
- Alternate product adjacencies in digital topology
- Adjacencies for Structuring the Digital Plane
- Generating cubical complexes from image data and computation of the Euler number
- A convenient graph connectedness for digital imagery
- Digital pseudomanifolds, digital weakmanifolds and Jordan--Brouwer separation theorem
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)
