A theory of binary digital pictures
From MaRDI portal
Recommendations
Cited in
(44)- Formulas for the number of (n-2)-gaps of binary objects in arbitrary dimension
- An isomorphism for digital images
- A Jordan surface theorem for three-dimensional digital spaces
- Concepts of digital topology
- Digital Jordan curves---a graph-theoretical approach to a topological theorem
- A note on alternative digital topologies
- The topology of digital images
- Digital calculus
- Closure operations for digital topology.
- Cell complexes, oriented matroids and digital geometry.
- Weak lighting functions and strong 26-surfaces.
- On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
- Relation-induced connectedness in the digital plane
- Categorical aspects of inducing closure operators on graphs by sets of walks
- A digital analogue of the Jordan curve theorem
- Digital imaging: a unified topological framework
- A Jordan curve theorem for 2-dimensional tilings
- A convenient graph connectedness for digital imagery
- Graphs with a path partition for structuring digital spaces
- New insight on digital topology.
- scientific article; zbMATH DE number 2129318 (Why is no real title available?)
- Digital images of geometric pictures
- scientific article; zbMATH DE number 1342267 (Why is no real title available?)
- scientific article; zbMATH DE number 2079738 (Why is no real title available?)
- scientific article; zbMATH DE number 4114087 (Why is no real title available?)
- Polyhedral Representation and Adjacency Graph in n-dimensional Digital Images
- A Jordan curve theorem with respect to certain closure operations on the digital plane
- Digital Jordan curves and surfaces with respect to a closure operator
- A note on dimension and gaps in digital geometry
- A closure operator for the digital plane
- Closure operators on graphs for modeling connectedness in digital spaces
- Combinatorial Relations for Digital Pictures
- Digitization of partitions and tessellations
- Digital Jordan curves and surfaces with respect to a graph connectedness
- Shape preserving digitization of ideal and blurred binary images.
- Surface-based computation of the Euler characteristic in the BCC grid
- A digital Jordan surface theorem with respect to a graph connectedness
- A fast scan-line algorithm for topological filling of well-nested objects in 2.5D digital pictures
- Adjacencies for recognition of digital Jordan surfaces
- Polyhedral digital Jordan surfaces
- Computer graphics and connected topologies on finite ordered sets
- Dimensional properties of graphs and digital spaces.
- Jordan surfaces in simply connected digital spaces.
- Connectivity preserving transformations for higher dimensional binary images
This page was built for publication: A theory of binary digital pictures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3026388)
