44 search results - page 3 / 9 » Optimal Cover of Points by Disks in a Simple Polygon |
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
CCCG
2006
15 years 1 months ago
2006
We introduce a generalization of monotonicity. An n-vertex polygon P is rotationally monotone with respect to a point r if there exists a partitioning of the boundary of P into ex...
101
click to vote
CORR
2002
Springer
14 years 11 months ago
2002
Springer
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity (S) of S is given by the smallest numb...
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
102
click to vote
ICCTA
2007
IEEE
15 years 6 months ago
2007
IEEE
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...