Pages that link to "Item:Q672143"
From MaRDI portal
The following pages link to Reconstructing convex polyominoes from horizontal and vertical projections (Q672143):
Displaying 50 items.
- Reconstruction of convex polyominoes with a blocking component (Q265062) (← links)
- The medians of discrete sets (Q293267) (← links)
- On finding medians of weighted discrete points (Q294747) (← links)
- Reconstructing convex matrices by integer programming approaches (Q387306) (← links)
- Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections (Q387855) (← links)
- Binary image reconstruction from a small number of projections and the morphological skeleton (Q499725) (← links)
- Minimal non-convex words (Q544886) (← links)
- Polyominoes simulating arbitrary-neighborhood zippers and tilings (Q652151) (← links)
- Binary matrices under the microscope: A tomographical problem (Q868951) (← links)
- A framework for generating some discrete sets with disjoint components by using uniform distributions (Q952451) (← links)
- Reconstruction of binary matrices under fixed size neighborhood constraints (Q952456) (← links)
- Reconstruction of convex lattice sets from tomographic projections in quartic time (Q952457) (← links)
- Scanning integer matrices by means of two rectangular windows (Q952464) (← links)
- A benchmark set for the reconstruction of \(hv\)-convex discrete sets (Q967404) (← links)
- Complexity results for the horizontal bar packing problem (Q975490) (← links)
- Solving nonograms by combining relaxations (Q1023434) (← links)
- Numerical characterization of \(n\)-cube subset partitioning (Q1026122) (← links)
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays (Q1301705) (← links)
- Polyominoes defined by their vertical and horizontal projections (Q1351218) (← links)
- Reconstructing \((h,v)\)-convex \(2\)-dimensional patterns of objects from approximate horizontal and vertical projections. (Q1401184) (← links)
- An algorithm reconstructing convex lattice sets. (Q1401390) (← links)
- The reconstruction of polyominoes from their orthogonal projections (Q1603404) (← links)
- Reconstruction of convex 2D discrete sets in polynomial time (Q1603651) (← links)
- Basic analytic combinatorics of directed lattice paths (Q1603684) (← links)
- A short scientific biography of Maurice Nivat (Q1605477) (← links)
- Reconstructing \(hv\)-convex polyominoes from orthogonal projections (Q1606912) (← links)
- Determination of Q-convex sets by X-rays (Q1770378) (← links)
- Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets (Q1775617) (← links)
- Algorithms for polyominoes based on the discrete Green theorem (Q1775619) (← links)
- Detection of the discrete convexity of polyominoes (Q1861555) (← links)
- The number of convex polyominoes reconstructible from their orthogonal projections (Q1924359) (← links)
- Digital convex + unimodular mapping = 8-connected (all points but one 4-connected) (Q2061794) (← links)
- Further steps on the reconstruction of convex polyominoes from orthogonal projections (Q2084620) (← links)
- Smooth column convex polyominoes (Q2167315) (← links)
- Reconstruction of hv-convex sets by their coordinate X-ray functions (Q2251295) (← links)
- On the generation of convex polyominoes (Q2255820) (← links)
- A network flow algorithm for reconstructing binary images from discrete X-rays (Q2384105) (← links)
- Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses (Q2422035) (← links)
- Regular switching components (Q2422036) (← links)
- A reconstruction algorithm for L-convex polyominoes. (Q2490808) (← links)
- An evolutionary algorithm for discrete tomography (Q2573237) (← links)
- Optimization and reconstruction of \(hv\)-convex (0,1)-matrices (Q2573240) (← links)
- An introduction to periodical discrete sets from a tomographical perspective (Q2576883) (← links)
- Random generation of \(Q\)-convex sets (Q2576884) (← links)
- In memoriam: Alberto Del Lungo (1965--2003) (Q2581342) (← links)
- The discrete Green theorem and some applications in discrete geometry (Q2581344) (← links)
- Reconstruction of convex polyominoes from orthogonal projections of their contours (Q2581356) (← links)
- Characterization of hv-convex sequences (Q2678923) (← links)
- A simulated annealing for reconstructing hv-convex binary matrices (Q2883593) (← links)
- Discrete Q-Convex Sets Reconstruction from Discrete Point X-Rays (Q3003547) (← links)