A framework for generating some discrete sets with disjoint components by using uniform distributions
From MaRDI portal
Publication:952451
DOI10.1016/j.tcs.2008.06.010zbMath1160.68033OpenAlexW2076697132MaRDI QIDQ952451
Publication date: 12 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.06.010
Related Items (4)
DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION ⋮ Reconstructing convex matrices by integer programming approaches ⋮ A benchmark set for the reconstruction of \(hv\)-convex discrete sets ⋮ Solving nonograms by combining relaxations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Reconstructing convex polyominoes from horizontal and vertical projections
- A calculus for the random generation of labelled combinatorial structures
- Algebraic languages and polyominoes enumeration
- An algorithm reconstructing convex lattice sets.
- Discrete tomography. Foundations, algorithms, and applications
- The reconstruction of polyominoes from their orthogonal projections
- Reconstructing \(hv\)-convex polyominoes from orthogonal projections
- Stability in discrete tomography: some positive results
- Reconstruction of \(hv\)-convex binary matrices from their absorbed projections
- Generating convex polyominoes at random
- On directed-convex polyominoes in a rectangle
- An evolutionary algorithm for discrete tomography
- Optimization and reconstruction of \(hv\)-convex (0,1)-matrices
- Random generation of \(Q\)-convex sets
- Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
- Fast Filling Operations Used in the Reconstruction of Convex Lattice Sets
- Comparison of algorithms for reconstructing \(hv\)-convex discrete sets
- Reconstruction of 4- and 8-connected convex discrete sets from row and column projections
This page was built for publication: A framework for generating some discrete sets with disjoint components by using uniform distributions
