Detection of the discrete convexity of polyominoes (Q1861555): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jean-Luc Rémy / rank
Normal rank
 
Property / author
 
Property / author: Jean-Luc Rémy / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CHIP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of algorithms for reconstructing \(hv\)-convex discrete sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2728902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing convex polyominoes from horizontal and vertical projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introducing global constraints in CHIP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of 4- and 8-connected convex discrete sets from row and column projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4277830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing \(hv\)-convex polyominoes from orthogonal projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4951148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4524013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of convex polyominoes reconstructible from their orthogonal projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4524010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating convex polyominoes at random / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3318142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digital Convexity, Straightness, and Convex Polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digital Straight Lines and Convexity of Digital Regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete tomography. Foundations, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4948843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reconstruction of polyominoes from their orthogonal projections / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(02)00227-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1827092650 / rank
 
Normal rank

Latest revision as of 08:39, 30 July 2024

scientific article
Language Label Description Also known as
English
Detection of the discrete convexity of polyominoes
scientific article

    Statements

    Detection of the discrete convexity of polyominoes (English)
    0 references
    0 references
    0 references
    9 March 2003
    0 references
    The paper deals with the notion of discrete convexity introduced by \textit{C. E. Kim} and \textit{A. Rosenfeld} [IEEE Trans. Pattern Anal. Mach. Intell. 4, 149-153 (1982; Zbl 0485.52007)]: a discrete region \(R\) is convex if its convex hull contains no discrete points of the complement of \(R\). A discrete region \(P\) is called polyomino if any couple of cells may be linked through a path containing only horizontal and vertical moves. A polyomino is \(hv\)-convex when cells of each row and each column are consecutive. Using only these definitions, the authors devise a simple algorithm to detect the convexity of a \(hv\)-polyomino. The main contribution of the paper under review is a linear algorithm for checking the convexity on the curve points of the border. Correctness of the method hinges on a new result on the construction of the convex hull of a discrete line segment. Preliminary conclusions on testing the discrete convexity of polyominoes by using the methods of constraint programming are reported.
    0 references
    0 references
    discrete convexity
    0 references
    segmentation
    0 references
    discrete line
    0 references
    polyominoes
    0 references
    discrete tomography
    0 references
    linear algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references