Detection of the discrete convexity of polyominoes

DOI10.1016/S0166-218X(02)00227-5zbMath1019.52008OpenAlexW1827092650MaRDI QIDQ1861555

Jocelyne Rouyer-Degli, Isabelle Debled-Rennesson, Jean-Luc Rémy

Publication date: 9 March 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00227-5

zbMATH Keywords

segmentationdiscrete tomographypolyominoesdiscrete convexitylinear algorithmdiscrete line

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05) Polyominoes (05B50) General convexity (52A99)

Related Items (10)

Lyndon + Christoffel = digitally convex ⋮ Convexity preserving deformations of digital sets: characterization of removable and insertable pixels ⋮ Efficiently testing digital convexity and recognizing digital convex polygons ⋮ A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) ⋮ Geometric preservation of 2D digital objects under rigid motions ⋮ On computing the degree of convexity of polyominoes ⋮ Faithful polygonal representation of the convex and concave parts of a digital curve ⋮ Combinatorial View of Digital Convexity ⋮ A Linear Time and Space Algorithm for Detecting Path Intersection ⋮ Efficient Algorithms to Test Digital Convexity

Uses Software

• CHIP

Cites Work

• Reconstructing convex polyominoes from horizontal and vertical projections
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Discrete tomography. Foundations, algorithms, and applications
• The reconstruction of polyominoes from their orthogonal projections
• Reconstructing \(hv\)-convex polyominoes from orthogonal projections
• Introducing global constraints in CHIP
• Generating convex polyominoes at random
• The number of convex polyominoes reconstructible from their orthogonal projections
• Digital Straight Lines and Convexity of Digital Regions
• Digital Convexity, Straightness, and Convex Polygons
• Comparison of algorithms for reconstructing \(hv\)-convex discrete sets
• Reconstruction of 4- and 8-connected convex discrete sets from row and column projections
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Detection of the discrete convexity of polyominoes