Dimensional properties of graphs and digital spaces.
DOI10.1007/BF00119834zbMATH Open1191.05088OpenAlexW1999146100MaRDI QIDQ960479FDOQ960479
Authors: Ralph Kopperman, Yurii V. Mukhin, Alexander V. Ivashchenko 
Publication date: 21 December 2008
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00119834
Recommendations
graphdimensioncomputer graphicsdigital imagedigital topologydigital spaceAlexandroff spacedigital pictureconnected ordered topological spacelocally finite space
Applications of graph theory (05C90) Computing methodologies for image processing (68U10) Connections of general topology with other structures, applications (54H99)
Cites Work
- Title not available (Why is that?)
- Digital Topology
- Connectivity in Digital Pictures
- Finarity substitute for continuous topology
- A Jordan surface theorem for three-dimensional digital spaces
- Computer graphics and connected topologies on finite ordered sets
- A Topological Approach to Digital Topology
- Representation of smooth surfaces by graphs. Transformations of graphs which do not change the Euler characteristic of graphs
- Some properties of contractible transformations on graphs
- Contractible transformations do not change the homology groups of graphs
- Topological structures in computer science
- Title not available (Why is that?)
Cited In (25)
- Equivalence between closed connected \(n\)-\(G\)-maps without multi-incidence and \(n\)-surfaces
- The digital \(n\)-space is quasi-submaximal
- Covering dimension and finite spaces
- A tutorial on well-composedness
- How to make \(n\)-D plain maps defined on discrete surfaces Alexandrov-well-composed in a self-dual way
- Introducing poset-based connected \(n\)-manifolds and \(\mathcal{P} \)-well-composedness in partially ordered sets
- The Alexandroff dimension of digital quotients of Euclidean spaces
- An algorithm of polynomial order for computing the covering dimension of a finite space
- Strongly normal sets of contractible tiles in \(n\) dimensions
- Order- and graph-theoretic investigation of dimensions of finite topological spaces and Alexandroff spaces
- Polyhedral Representation and Adjacency Graph in n-dimensional Digital Images
- Connected sum of digital closed surfaces
- Classification of digital \(n\)-manifolds
- Algorithmic counting of zero-dimensional finite topological spaces with respect to the covering dimension
- Title not available (Why is that?)
- Derived neighborhoods and frontier orders
- Derived neighborhoods and frontier orders
- Topological graph dimension
- A study of the quasi covering dimension of Alexandroff countable spaces using matrices
- Jordan surface theorem for simple closed \textit{SST}-surfaces
- On topological dimension and digital topology
- Investigation of medical 3D-rendering algorithms
- How to Make nD Functions Digitally Well-Composed in a Self-dual Way
- Equivalence between digital well-composedness and well-composedness in the sense of Alexandrov on \(n\)-d cubical grids
- Convex and Concave Vertices on a Simple Closed Curve in the Triangular Grid
This page was built for publication: Dimensional properties of graphs and digital spaces.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960479)
