21 search results - page 1 / 5 » On point covers of c-oriented polygons |
CCCG
2001
14 years 7 days ago
2001
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
CCCG
1998
14 years 6 days ago
1998
Let S be any family of n c-oriented polygons of the two-dimensional Euclidean plane E2 , i.e., bounded intersection of halfplanes whose normal directions of edges belong to a
ESA
2010
Springer
13 years 12 months ago
2010
Springer
GC
2007
Springer
13 years 10 months ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
CCCG
2010
14 years 9 days ago
2010
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...