Orthogonally convex coverings of orthogonal polygons without holes
نویسندگان
چکیده
منابع مشابه
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کاملInapproximability Results for Guarding Polygons without Holes
The three art gallery problems Vertex Guard, Edge Guard and Point Guard are known to be NP -hard [8]. Approximation algorithms for Vertex Guard and Edge Guard with a logarithmic ratio were proposed in [7]. We prove that for each of these problems, there exists a constant > 0, such that no polynomial time algorithm can guarantee an approximation ratio of 1 + unless P = NP . We obtain our results...
متن کاملIndecomposable coverings with homothetic polygons
We prove that for any polygon S with at least four sides, and any k > 0, there is a k-fold covering of the plane with homothetic copies of S that can not be decomposed into two coverings.
متن کاملMultiple Coverings with Closed Polygons
A planar set P is said to be cover-decomposable if there is a constant k = k(P ) such that every k-fold covering of the plane with translates of P can be decomposed into two coverings. It is known that open convex polygons are cover-decomposable. Here we show that closed, centrally symmetric convex polygons are also cover-decomposable. We also show that an infinite-fold covering of the plane wi...
متن کاملMaximal Number of Edges in Geometric Graphs without Convex Polygons
A geometric graph G is a graph whose vertex set is a set Pn of n points on the plane in general position, and whose edges are straight line segments (which may cross) joining pairs of vertices of G. We say that G contains a convex r-gon if its vertex and edge sets contain, respectively, the vertices and edges of a convex polygon with r vertices. In this paper we study the following problem: Whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1989
ISSN: 0022-0000
DOI: 10.1016/0022-0000(89)90043-3