2 search results - page 1 / 1 » Packing Two Disks into a Polygonal Environment |
COCOON
2001
Springer
13 years 9 months ago
2001
Springer
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
COCOON
2006
Springer
13 years 8 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...