44 search results - page 6 / 9 » Optimal Cover of Points by Disks in a Simple Polygon |
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m + r + b. A ham-sandwich geodesic is ...
CCCG
2006
14 years 11 months ago
2006
A room is a simple polygon with a prespecified point, called the door, on its boundary. A search starts at the door and must detect any intruder that may be in the room, while maki...
ICCSA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
TCC
2007
Springer
15 years 3 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
SODA
1992
ACM
14 years 10 months ago
1992
ACM
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...