6 search results - page 1 / 2 » An algorithm for searching a polygonal region with a flashli... |
COMPGEOM
2000
ACM
13 years 9 months ago
2000
ACM
LATIN
2010
Springer
13 years 10 months ago
2010
Springer
Consider a dark polygonal region in which intruders move freely, trying to avoid detection. A robot, which is equipped with a flashlight, moves along the polygon boundary to illum...
SODA
1992
ACM
13 years 6 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 ...
W2GIS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
CCCG
1993
13 years 6 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...