Guarding Polyominoes Under k-Hop Visibility
We study the ART GALLERY Problem under k-hop visibility in polyominoes. In this visibility model, two unit squares of a polyomino can see each other if and only if the shortest path between the respective vertices in the dual graph of the polyomino has ...
Krohn, Erik, +4 more
core +1 more source
Folding polyominoes with holes into a cube
When can a polyomino piece of paper be folded into a unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open problem. We present sufficient conditions for a polyomino with hole(s) to fold into a cube, and
Löffler, Maarten +11 more
core +1 more source
Inspiration From Games and Entertainment Artifacts: A Rising Paradigm for Designing Mechanisms and Algorithms in Robotics. [PDF]
Tan N +3 more
europepmc +1 more source
The reconstruction of polyominoes from approximately orthogonal projections
The reconstruction of discrete two-dimensional pictures from their projections is one of the central problems in the areas of medical diagnostics, computer-aided tomography, pattern recognition, image processing, and data compression.
Gębala, Maciej
core
The organization of biological sequences into constrained and unconstrained parts determines fundamental properties of genotype-phenotype maps. [PDF]
Greenbury SF, Ahnert SE.
europepmc +1 more source
Modified A-Star Algorithm for Efficient Coverage Path Planning in Tetris Inspired Self-Reconfigurable Robot with Integrated Laser Sensor. [PDF]
Le AV +3 more
europepmc +1 more source
Common Dorsal Stream Substrates for the Mapping of Surface Texture to Object Parts and Visual Spatial Processing. [PDF]
Zachariou V +5 more
europepmc +1 more source
An inversion-based clustering approach for complex clusters. [PDF]
Barati Jozan MM +3 more
europepmc +1 more source
A tractable genotype-phenotype map modelling the self-assembly of protein quaternary structure. [PDF]
Greenbury SF +3 more
europepmc +1 more source

