Folding polyominoes with holes into a cube
نویسندگان
چکیده
When can a polyomino piece of paper be folded into unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open problem. We present sufficient conditions for one or several to fold cube, and under which cube folding is impossible. In particular, we show that all five special “basic” guarantee foldability.
منابع مشابه
Folding Polyominoes into (Poly)Cubes
We study the problem of folding a given polyomino S into a polycube C under different folding models, allowing faces of C to be covered multiple times.
متن کاملInfluence of insertion of holes in the middle of obstacles on the flow around a surface-mounted cube
The aim of our study is to analyze the impact of insertion holes in the middle of obstacles on the flow around a surface-mounted cube, In order to do this; we studied four configurations of obstacles in a channel with a Reynods number based on obstacle height ReH = 40000. The hexahedral structured meshes were used to solve the fluid dynamics equations .The finite volume method are employed to s...
متن کاملCube packings, second moment and holes
We consider tilings and packings of R by integral translates of cubes [0, 2[, which are 4Z-periodic. Such cube packings can be described by cliques of an associated graph, which allow us to classify them in dimension d ≤ 4. For higher dimension, we use random methods for generating some examples. Such a cube packing is called non-extendible if we cannot insert a cube in the complement of the pa...
متن کاملTiling a Rectangle with Polyominoes
A polycube in dimension d is a finite union of unit d-cubes whose vertices are on knots of the lattice Zd . We show that, for each family of polycubes E, there exists a finite set F of bricks (parallelepiped rectangles) such that the bricks which can be tiled by E are exactly the bricks which can be tiled by F . Consequently, if we know the set F , then we have an algorithm to decide in polynom...
متن کاملClumsy packings with polyominoes
For a set D of polyominoes, a packing of the plane with D is a maximal set of copies of polyominoes from D that are not overlapping. A packing with smallest density is called clumsy packing. We give an example of a set D such that any clumsy packing is aperiodic. In addition, we compute the smallest possible density of a clumsy packing when D consist of a single polyomino of a given size and sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry: Theory and Applications
سال: 2021
ISSN: ['0925-7721', '1879-081X']
DOI: https://doi.org/10.1016/j.comgeo.2020.101700