26 search results - page 1 / 6 » Translational polygon covering using intersection graphs |
CCCG
2001
13 years 6 months 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 ...
COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
Abstract. We study the grid size that is needed to represent intersection graphs of convex polygons. Here the polygons are similar to a base polygon P whose corners have rational c...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
CGF
2006
13 years 5 months ago
2006
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
COMPGEOM
1998
ACM
13 years 9 months ago
1998
ACM
An algorithm and a robust floating point implementation is given for rotational polygon containment: given polygons P1,P2,P3,...,Pk and a container polygon C, find rotations and...