Add to ORKGA polygonal cover of a finite collection of pairwise disjoint convex compact sets in the plane is a finite collection of non-overlapping convex polygons such that each polygon covers exactly one convex set. We show that computing a polygonal cover with worst case minimal number of sides reduces to computing a pseudo-triangulation of the collection of convex sets. We obtain a similar reduction for two related problems concerning convex compact sets in the plane : computing a lighting set and computing a family of separating lines. Keywords: Pseudotriangle, pseudo-triangulation, polygonal cover, translation query, Art gallery theorem, packing, covering. On Polygonal Covers M. Pocchiola & G. Vegter 1 Introduction A polygonal cover of a ...
We introduce pseudo-convex decompositions, partitions, and coverings for planar point sets. They are...
A pseudo-triangle is a simple polygon with exactly three convex vertices, and a pseudo-triangulation...
A set ${ cal P} = P sb1,P sb2, ...,P sb{k}$ of polygons is called a k-cover of a simple polygon P if...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
Abstract. We propose a novel subdivision of the plane that consists of both convex poly-gons and pse...
We introduce pseudo-convex decompositions, partitions, and coverings for planar point sets. They are...
A pseudo-triangle is a simple polygon with exactly three convex vertices, and a pseudo-triangulation...
A set ${ cal P} = P sb1,P sb2, ...,P sb{k}$ of polygons is called a k-cover of a simple polygon P if...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangl...
Abstract. We propose a novel subdivision of the plane that consists of both convex poly-gons and pse...
We introduce pseudo-convex decompositions, partitions, and coverings for planar point sets. They are...
A pseudo-triangle is a simple polygon with exactly three convex vertices, and a pseudo-triangulation...
A set ${ cal P} = P sb1,P sb2, ...,P sb{k}$ of polygons is called a k-cover of a simple polygon P if...