On the decomposability of homogeneous binary planar configurations with respect to a given exact polyomino
DOI10.1007/978-3-031-19897-7_12zbMATH Open1522.68625OpenAlexW4313123393MaRDI QIDQ6160796FDOQ6160796
Authors: Michela Ascolese, Andrea Frosini 
Publication date: 2 June 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-19897-7_12
Recommendations
- Planar configurations induced by exact polyominoes
- Combinatorial aspects of \(L\)-convex polyominoes
- Decomposition of planar graphs with forbidden configurations
- scientific article; zbMATH DE number 1501958
- A decomposition of column-convex polyominoes and two vertex statistics
- Decomposability of polytopes
- scientific article; zbMATH DE number 5542507
- Combinatorics of plane ?-homogeneous tetraangulations
- On the exact complexity of polyomino packing
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)
Cites Work
- Title not available (Why is that?)
- Combinatorial properties of double square tiles
- On translating one polyomino to tile the plane
- A parallelogram tile fills the plane by translation in at most two distinct ways
- Homogeneous subsets of \(\mathbb Z^2\) and plane tilings
- Binary matrices under the microscope: A tomographical problem
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: On the decomposability of homogeneous binary planar configurations with respect to a given exact polyomino
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160796)
