Decomposition algorithms for reconstructing discrete sets with disjoint components
From MaRDI portal
Recommendations
- Discrete Geometry for Computer Imagery
- Reconstruction of Discrete Sets from Four Projections: Strong Decomposability
- DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION
- Solving multicolor discrete tomography problems by using prior knowledge
- scientific article; zbMATH DE number 1551778
Cited in
(5)- Convex \((0, 1)\)-matrices and their epitopes
- Reconstructive dispersers and hitting set generators
- Solving multicolor discrete tomography problems by using prior knowledge
- Reconstruction of Discrete Sets from Four Projections: Strong Decomposability
- A framework for generating some discrete sets with disjoint components by using uniform distributions
This page was built for publication: Decomposition algorithms for reconstructing discrete sets with disjoint components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434303)