Further steps on the reconstruction of convex polyominoes from orthogonal projections

DOI10.1007/s10878-021-00751-zOpenAlexW3161265967MaRDI QIDQ2084620

Paolo Dulio, Lama Tarsissi, Laurent Vuillon, Simone Rinaldi, Andrea Frosini

Publication date: 18 October 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00751-z

zbMATH Keywords

discrete geometryreconstruction problemdiscrete tomographydigital convexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex functions and convex programs in convex geometry (52A41) Polyominoes (05B50)

Related Items (5)

Reconstruction of Convex Sets from One or Two X-rays ⋮ Convexity preserving deformations of digital sets: characterization of removable and insertable pixels ⋮ Algorithms for pixelwise shape deformations preserving digital convexity ⋮ Properties of SAT formulas characterizing convex sets with given projections ⋮ \textsc{Minimum Surgical Probing} with convexity constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconstructing convex polyominoes from horizontal and vertical projections
• A theorem on flows in networks
• Lyndon + Christoffel = digitally convex
• On periodic properties of circular words
• Polygons, polyominoes and polycubes
• Matrices of zeros and ones with fixed row and column sum vectors
• Switching components and the ambiguity problem in the reconstruction of pictures from their projections
• On the computational complexity of reconstructing lattice sets from their \(X\)-rays
• Certain words on the real projective line
• Some combinatorial properties of Sturmian words
• \(\alpha\)-words and factors of characteristic sequences
• Sturmian words: structure, combinatorics, and their arithmetics
• Sturmian words, Lyndon words and trees
• Discrete tomography. Foundations, algorithms, and applications
• First steps in the algorithmic reconstruction of digital convex sets
• The number of convex polyominoes reconstructible from their orthogonal projections
• An efficient algorithm for determining the convex hull of a finite planar set
• Factorizing words over an ordered alphabet
• A geometrical characterization of regions of uniqueness and applications to discrete tomography
• Three-dimensional Statistical Data Security Problems
• Discrete tomography: Determination of finite sets by X-rays
• Regions of Uniqueness Quickly Reconstructed by Three Directions in Discrete Tomography
• Asymptotic Analysis and Random Sampling of Digitally Convex Polyominoes
• On the Degree Sequences of Uniform Hypergraphs
• Uniqueness Theorems for Periodic Functions
• Fast Filling Operations Used in the Reconstruction of Convex Lattice Sets
• A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences
• Geometrical Characterization of the Uniqueness Regions Under Special Sets of Three Directions in Discrete Tomography
• X-rays characterizing some classes of discrete sets
• Reconstruction of 4- and 8-connected convex discrete sets from row and column projections

This page was built for publication: Further steps on the reconstruction of convex polyominoes from orthogonal projections