scholarly journals Orthogonal Art Galleries with Holes: A Coloring Proof of Aggarwal's Theorem

10.37236/1046 ◽  
2006 ◽  
Vol 13 (1) ◽  
Author(s):  
Paweł Żyliński

We prove that $\lfloor{n+h\over 4}\rfloor$ 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 exists a quadrilateralization whose dual graph is a cactus. Our proof is based upon $4$-coloring of a quadrilateralization graph, and it is similar to that of Kahn and others for orthogonal polygons without holes. Consequently, we provide an alternate proof of Aggarwal's theorem asserting that $\lfloor{n+h\over 4}\rfloor$ vertex guards always suffice to cover any $n$-vertex orthogonal polygon with $h \le 2$ holes.

2007 ◽  
Vol Vol. 9 no. 1 (Analysis of Algorithms) ◽  
Author(s):  
Chris Worman ◽  
Boting Yang

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.


1998 ◽  
Vol 08 (01) ◽  
pp. 25-38 ◽  
Author(s):  
James Abello ◽  
Vladimir Estivill-Castro ◽  
Thomas Shermer ◽  
Jorge Urrutia

We provide the first tight bound for covering an orthogonal polygon with n vertices and h holes with vertex floodlights (guards with restricted angle of vision). In particular, we provide tight bounds for the number of orthogonal floodlights, placed at vertices or on the boundary, sufficient to illuminate the interior or the exterior of an orthogonal polygon with holes. Our results lead directly to very simple linear, and thus optimal, algorithms for computing a covering of an orthogonal polygon.


2013 ◽  
Vol 23 (01) ◽  
pp. 65-71 ◽  
Author(s):  
TOSHIHIRO SHIRAKAWA ◽  
RYUHEI UEHARA

We investigate common developments that can fold into several incongruent orthogonal boxes. It was shown that there are infinitely many orthogonal polygons that fold into two incongruent orthogonal boxes in 2008. In 2011, it was shown that there exists an orthogonal polygon that folds into three boxes of size 1 × 1 × 5, 1 × 2 × 3, and 0 × 1 × 11. However it remained open whether there exists an orthogonal polygon that folds into three boxes of positive volume. We give an affirmative answer to this open problem. We show how to construct an infinite number of orthogonal polygons that fold into three incongruent orthogonal boxes.


2012 ◽  
Vol 22 (02) ◽  
pp. 103-141 ◽  
Author(s):  
ANDRZEJ LINGAS ◽  
AGNIESZKA WASYLEWICZ ◽  
PAWEŁ ŻYLIŃSKI

The complexity status of the minimum r-star cover problem for orthogonal polygons had been open for many years, until 2004 when Ch. Worman and J. M. Keil proved it to be polynomially tractable (Polygon decomposition and the orthogonal art gallery problem, IJCGA 17(2) (2007), 105-138). However, since their algorithm has Õ(n17)-time complexity, where Õ(·) hides a polylogarithmic factor, and thus it is not practical, in this paper we present a linear-time 3-approximation algorithm. Our approach is based upon the novel partition of an orthogonal polygon into so-called o-star-shaped orthogonal polygons.


1997 ◽  
Vol 07 (05) ◽  
pp. 473-484 ◽  
Author(s):  
J. Mark Keil

Given a simply connected orthogonal polygon P, a polynomial time algorithm is presented to cover the polygon with the minimum number of rectangles, under the restriction that if A and B are two overlapping rectangles in the cover then either A - B or B - A is connected. The algorithm runs in O(n log n + nm) time, where n is the number of vertices of P and m is the number of edges in the visibility graph of P that are either horizontal, vertical or form the diagonal of an empty rectangle.


2020 ◽  
Vol 2020 (11) ◽  
pp. 267-1-267-8
Author(s):  
Mitchell J.P. van Zuijlen ◽  
Sylvia C. Pont ◽  
Maarten W.A. Wijntjes

The human face is a popular motif in art and depictions of faces can be found throughout history in nearly every culture. Artists have mastered the depiction of faces after employing careful experimentation using the relatively limited means of paints and oils. Many of the results of these experimentations are now available to the scientific domain due to the digitization of large art collections. In this paper we study the depiction of the face throughout history. We used an automated facial detection network to detect a set of 11,659 faces in 15,534 predominately western artworks, from 6 international, digitized art galleries. We analyzed the pose and color of these faces and related those to changes over time and gender differences. We find a number of previously known conventions, such as the convention of depicting the left cheek for females and vice versa for males, as well as unknown conventions, such as the convention of females to be depicted looking slightly down. Our set of faces will be released to the scientific community for further study.


2020 ◽  
pp. 15-19
Author(s):  
M.N. Kirsanov

Formulae are obtained for calculating the deformations of a statically determinate lattice under the action of two types of loads in its plane, depending on the number of panels located along one side of the lattice. Two options for fixing the lattice are analyzed. Cases of kinematic variability of the structure are found. The distribution of forces in the rods of the lattice is shown. The dependences of the force loading of some rods on the design parameters are obtained. Keywords: truss, lattice, deformation, exact solution, deflection, induction, Maple system. [email protected]


Sign in / Sign up

Export Citation Format

Share Document