An algorithm reconstructing convex lattice sets.
From MaRDI portal
Recommendations
- A reconstruction algorithm for L-convex polyominoes.
- Reconstruction of \(Q\)-convex lattice sets
- An algorithm for reconstructing convex bodies from their projections
- Fast Filling Operations Used in the Reconstruction of Convex Lattice Sets
- scientific article; zbMATH DE number 2214611
- An Alternative Algorithm for Counting Lattice Points in a Convex Polytope
- Publication:4938470
- scientific article; zbMATH DE number 2079720
- Reconstruction of convex 2D discrete sets in polynomial time
- Rebuilding convex sets in graphs
Cites work
- scientific article; zbMATH DE number 1629857 (Why is no real title available?)
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- An efficient algorithm for determining the convex hull of a finite planar set
- Approximate X-rays reconstruction of special lattice sets
- Discrete tomography: Determination of finite sets by X-rays
- Medians of discrete sets according to a linear distance
- On the computational complexity of reconstructing lattice sets from their X-rays
- Reconstructing \(hv\)-convex polyominoes from orthogonal projections
- Reconstructing convex polyominoes from horizontal and vertical projections
- The reconstruction of polyominoes from their orthogonal projections
Cited in
(31)- Reconstruction of convex lattice sets from tomographic projections in quartic time
- Reconstructing a binary matrix under timetabling constraints
- A \(Q\)-convexity vector descriptor for image analysis
- A framework for generating some discrete sets with disjoint components by using uniform distributions
- Reconstruction of \(Q\)-convex lattice sets
- Ghosts in discrete tomography
- Uniqueness and reconstruction of finite lattice sets from their line sums
- Determination of Q-convex sets by X-rays
- Stability in discrete tomography: some positive results
- Reconstruction of hv-convex sets by their coordinate X-ray functions
- Discrete Q-convex sets reconstruction from discrete point X-rays
- An algorithm for the reconstruction of hv-convex planar bodies by finitely many and noisy measurements of their coordinate X-rays
- Parallel Cholesky-based reduction for the weighted integer least squares problem
- Random generation of \(Q\)-convex sets
- Approximate X-rays reconstruction of special lattice sets
- A spatial convexity descriptor for object enlacement
- scientific article; zbMATH DE number 2079720 (Why is no real title available?)
- Discrete Point X-Rays of Convex Lattice Sets
- Salient and reentrant points of discrete sets
- Determination of Q-convex bodies by X-rays
- Salient and Reentrant Points of Discrete Sets
- On the existence of \(U\)-polygons of class \(c\geq 4\) in planar point sets
- On some geometric aspects of the class of \(hv\)-convex switching components
- Characterization of hv-convex sequences
- An introduction to periodical discrete sets from a tomographical perspective
- Fast Filling Operations Used in the Reconstruction of Convex Lattice Sets
- A network flow algorithm for reconstructing binary images from discrete X-rays
- Reconstruction of lattice sets from their horizontal, vertical and diagonal \(X\)-rays
- DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION
- Reconstructing convex polygons in the plane from one directed X-ray
- Reconstruction of Convex Sets from One or Two X-rays
This page was built for publication: An algorithm reconstructing convex lattice sets.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401390)
