Characterizing and covering some subclasses of orthogonal polygons.
 作者： Ana Mafalda Martins,  Ant\'onio Leslie Bajuelos 刊名： Alexandrov, Vassil N. (ed.) et al., Computational science -- ICCS 2006. 6th international conference, Reading, UK, May 28--31, 2006. Proceedings, Part II. Berlin: Springer. Lecture Notes in Computer Science 3992, 255-262 (2006)., 2006, pp.255-262 来源数据库： ZBMATH期刊 原始语种摘要： Summary: A grid $n$-ogon is an $n$-vertex orthogonal polygon that may be placed in a $\frac{n}{2}\times \frac{n}{2}$ unit square grid and that does not have collinear edges. Given a grid $n$-ogon $P$, let $\vert\Pi (P)\vert$ be the number of rectangles that results when we partition $P$ by extending the edges incident to reflex vertices towards its interior. $P$ is called Fat if $\vert\Pi (P)\vert$ is maximal for all grid $n$-ogons; $P$ is called Thin if $\vert\Pi (P)\vert$ is minimal for all grid $n$-ogons. Thins with area $2r+1$ are called Min-Area. We will show that $\lceil\frac{n}{6}\rceil$ vertex guards are necessary to guard a Min-Area grid $n$-ogon and present some problems related to Thins.

• covering　覆盖物
• vertex
• called　被呼叫的
• guard　防护
• polygon　多边形
• square　正方形
• minimal　最小的
• collinear　共线的
• orthogonal　直交的
• extending　伸展