Minimum Covers for Grids and Orthogonal Polygons by Periscope Guards

1990 ◽  
Author(s):  
Laxmi Gewali ◽  
Simeon Ntafos
Keyword(s):  
Orthogonal Polygons

Guarding two Subclasses of Orthogonal Polygons

2019 ◽  
pp. 372-375
Author(s):  
Ana Mafalda Martins ◽  
Antonio Leslie Bajuelos
Keyword(s):  
Orthogonal Polygons

Staircase kernels in orthogonal polygons

1992 ◽  
Vol 59 (6) ◽  
pp. 588-594 ◽  
Author(s):  
Marilyn Breen
Keyword(s):  
Orthogonal Polygons

A Krasnosel'skii theorem for staircase paths in orthogonal polygons

1994 ◽  
Vol 51 (1-2) ◽  
pp. 22-30 ◽  
Author(s):  
Marilyn Breen
Keyword(s):  
Orthogonal Polygons

scholarly journals On the tileability of polygons with colored dominoes

2007 ◽  
Vol Vol. 9 no. 1 (Analysis of Algorithms) ◽  
Author(s):  
Chris Worman ◽  
Boting Yang
Keyword(s):  
Analysis Of Algorithms ◽  
Time Algorithm ◽  
Orthogonal Polygon ◽  
Orthogonal Polygons ◽  
Domino Tiling ◽  
International Audience ◽  
Np Complete

Analysis of Algorithms International audience We consider questions concerning the tileability of orthogonal polygons with colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squares, which are called faces, each of which is assigned a color. In a colored domino tiling of an orthogonal polygon P, a set of dominoes completely covers P such that no dominoes overlap and so that adjacent faces have the same color. We demonstrated that for simple layout polygons that can be tiled with colored dominoes, two colors are always sufficient. We also show that for tileable non-simple layout polygons, four colors are always sufficient and sometimes necessary. We describe an O(n) time algorithm for computing a colored domino tiling of a simple orthogonal polygon, if such a tiling exists, where n is the number of dominoes used in the tiling. We also show that deciding whether or not a non-simple orthogonal polygon can be tiled with colored dominoes is NP-complete.

Sign in / Sign up

Export Citation Format

Share Document