Discrete Geometry for Computer Imagery
From MaRDI portal
Publication:5316518
DOI10.1007/b135490zbMath1118.68695MaRDI QIDQ5316518
Simone Rinaldi, Antonio Restivo, Giuseppa Castiglione, Andrea Frosini
Publication date: 13 September 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b135490
52B55: Computational aspects related to convexity
68U10: Computing methodologies for image processing
92C55: Biomedical imaging and signal processing
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05B50: Polyominoes
Related Items
Reconstruction of convex polyominoes with a blocking component, On computing the degree of convexity of polyominoes, On the exhaustive generation of \(k\)-convex polyominoes, On the tiling system recognizability of various classes of convex polyominoes, Algorithms for linear time reconstruction by discrete tomography, The number of directed \(k\)-convex polyominoes, Combinatorial aspects of \(L\)-convex polyominoes, Discrete tomography for inscribable lattice sets, The number of Z-convex polyominoes, A reconstruction algorithm for L-convex polyominoes., Enumeration of L-convex polyominoes by rows and columns, Permutation classes and polyomino classes with excluded submatrices, Reconstruction of Discrete Sets from Four Projections: Strong Decomposability, Recognizable Picture Languages and Polyominoes