Sciweavers

COMBINATORICS
2006
155views more  COMBINATORICS 2006»
13 years 11 months ago
Orthogonal Art Galleries with Holes: A Coloring Proof of Aggarwal's Theorem
We prove that n+h 4 vertex guards are always sufficient to see the entire interior of an n-vertex orthogonal polygon P with an arbitrary number h of holes provided that there exis...
Pawel Zylinski
ISAAC
2005
Springer
86views Algorithms» more  ISAAC 2005»
14 years 5 months ago
On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
Chris Worman, Boting Yang