Reconstructing convex polyominoes from horizontal and vertical projections

From MaRDI portal

Publication:672143

Jump to:navigation, search

DOI10.1016/0304-3975(94)00293-2zbMath0872.68134OpenAlexW2093699598MaRDI QIDQ672143

Elena Barcucci, Renzo Pinzani, Maurice Nivat, Alberto del Lungo

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00293-2

zbMATH Keywords

pattern recognition image processing data compression numerical matching with target sums problem Reconstructing discrete bidimensional sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polyominoes (05B50)

Related Items

Reconstruction of convex polyominoes with a blocking component, A simulated annealing for reconstructing hv-convex binary matrices, The medians of discrete sets, On finding medians of weighted discrete points, Polyominoes defined by their vertical and horizontal projections, A network flow algorithm for reconstructing binary images from discrete X-rays, DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION, A geometrical characterization of regions of uniqueness and applications to discrete tomography, ENUMERATION OF n-CONNECTED OMINOES INSCRIBED IN AN ABACUS, Binary matrices under the microscope: A tomographical problem, Smooth column convex polyominoes, Reconstructing convex matrices by integer programming approaches, Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections, Reconstruction of Convex Sets from One or Two X-rays, Characterization of hv-convex sequences, Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses, Regular switching components, Reconstructing \((h,v)\)-convex \(2\)-dimensional patterns of objects from approximate horizontal and vertical projections., An extremal graph problem on a grid and an isoperimetric problem for polyominoes, An algorithm reconstructing convex lattice sets., Properties of SAT formulas characterizing convex sets with given projections, \textsc{Minimum Surgical Probing} with convexity constraints, Discrete tomography: Determination of finite sets by X-rays, Recognizable Picture Languages and Polyominoes, Polyominoes simulating arbitrary-neighborhood zippers and tilings, Discrete Q-Convex Sets Reconstruction from Discrete Point X-Rays, Binary image reconstruction from a small number of projections and the morphological skeleton, RECONSTRUCTION OF TWO SUBCLASSES OF 2L-CONVEX POLYOMINOES, A framework for generating some discrete sets with disjoint components by using uniform distributions, Reconstruction of binary matrices under fixed size neighborhood constraints, Reconstruction of convex lattice sets from tomographic projections in quartic time, Scanning integer matrices by means of two rectangular windows, Reconstruction of hv-convex sets by their coordinate X-ray functions, On the generation of convex polyominoes, A benchmark set for the reconstruction of \(hv\)-convex discrete sets, Minimal non-convex words, A reconstruction algorithm for L-convex polyominoes., Complexity results for the horizontal bar packing problem, Determination of Q-convex sets by X-rays, Reconstruction of domino tiling from its two orthogonal projections, Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets, Algorithms for polyominoes based on the discrete Green theorem, X-rays characterizing some classes of discrete sets, 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, An algorithm for discrete tomography, Two-view ``cylindrical decomposition of binary images, Approximating hv-Convex Binary Matrices and Images from Discrete Projections, Solving nonograms by combining relaxations, Digital convex + unimodular mapping = 8-connected (all points but one 4-connected), Numerical characterization of \(n\)-cube subset partitioning, Efficient Algorithms to Test Digital Convexity, Convex Aggregation Problems in $$\mathbb {Z}^2$$, Further steps on the reconstruction of convex polyominoes from orthogonal projections, On the computational complexity of reconstructing lattice sets from their \(X\)-rays, An evolutionary algorithm for discrete tomography, Optimization and reconstruction of \(hv\)-convex (0,1)-matrices, An introduction to periodical discrete sets from a tomographical perspective, Random generation of \(Q\)-convex sets, In memoriam: Alberto Del Lungo (1965--2003), The discrete Green theorem and some applications in discrete geometry, Reconstruction of convex polyominoes from orthogonal projections of their contours, Optimization and reconstruction of hv-convex (0,1)-matrices, An experimental study of the stability problem in discrete tomography, Reconstruction of L-convex Polyominoes, Reconstructing a binary matrix under timetabling constraints, 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, Basic analytic combinatorics of directed lattice paths, A short scientific biography of Maurice Nivat, Reconstructing \(hv\)-convex polyominoes from orthogonal projections

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:672143&oldid=12574912"