A reconstruction algorithm for L-convex polyominoes. (Q2490808): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Reconstructing convex polyominoes from horizontal and vertical projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial aspects of \(L\)-convex polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of L-convex polyominoes by rows and columns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Geometry for Computer Imagery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of L-convex Polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machines, Computations, and Universality / 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: Checker Boards and Polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of convex 2D discrete sets in polynomial time / rank
 
Normal rank

Revision as of 13:19, 24 June 2024

scientific article
Language Label Description Also known as
English
A reconstruction algorithm for L-convex polyominoes.
scientific article

    Statements

    Identifiers