Reconstructing \(hv\)-convex polyominoes from orthogonal projections
From MaRDI portal
Publication:1606912
DOI10.1016/S0020-0190(99)00025-3zbMath1002.68101WikidataQ55895938 ScholiaQ55895938MaRDI QIDQ1606912
Publication date: 25 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polyominoes (05B50)
Related Items
Reconstruction of convex polyominoes with a blocking component ⋮ DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION ⋮ Binary matrices under the microscope: A tomographical problem ⋮ Reconstructing convex matrices by integer programming approaches ⋮ Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections ⋮ Discrete tomography with unknown intensity levels using higher-order statistics ⋮ Reconstructing \((h,v)\)-convex \(2\)-dimensional patterns of objects from approximate horizontal and vertical projections. ⋮ An algorithm reconstructing convex lattice sets. ⋮ A multistage view on 2-satisfiability ⋮ A measure of \(Q\)-convexity for shape analysis ⋮ Polyominoes simulating arbitrary-neighborhood zippers and tilings ⋮ RECONSTRUCTION OF TWO SUBCLASSES OF 2L-CONVEX POLYOMINOES ⋮ A framework for generating some discrete sets with disjoint components by using uniform distributions ⋮ Reconstruction of convex lattice sets from tomographic projections in quartic time ⋮ Scanning integer matrices by means of two rectangular windows ⋮ A benchmark set for the reconstruction of \(hv\)-convex discrete sets ⋮ Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets ⋮ Reconstructing \(hv\)-convex multi-coloured polyominoes ⋮ Comparison of algorithms for reconstructing \(hv\)-convex discrete sets ⋮ Reconstruction of 4- and 8-connected convex discrete sets from row and column projections ⋮ On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays ⋮ Approximating hv-Convex Binary Matrices and Images from Discrete Projections ⋮ An introduction to periodical discrete sets from a tomographical perspective ⋮ An experimental study of the stability problem in discrete tomography ⋮ Reconstruction of Discrete Sets from Four Projections: Strong Decomposability ⋮ Detection of the discrete convexity of polyominoes ⋮ The reconstruction of polyominoes from their orthogonal projections ⋮ Reconstruction of convex 2D discrete sets in polynomial time ⋮ A short scientific biography of Maurice Nivat
Cites Work
- Unnamed Item
- Reconstructing convex polyominoes from horizontal and vertical projections
- Matrices of zeros and ones with fixed row and column sum vectors
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays
- The reconstruction of polyominoes from their orthogonal projections
- On the Complexity of Timetable and Multicommodity Flow Problems
