7 search results - page 1 / 2 » Cluster connecting problem inside a polygon |
CCCG
2010
15 years 1 months ago
2010
The cluster connecting problem inside a simple polygon is introduced in this paper. The problem is shown to be NP-complete. A log n-factor approximation algorithm is proposed.
COMPGEOM
1994
ACM
15 years 3 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
ALGOSENSORS
2008
Springer
15 years 1 months ago
2008
Springer
With the current progress in robot technology and related areas, sophisticated moving and sensing capabilities are at hand to design robots capable of solving seemingly complex tas...
181
click to vote
GIS
2008
ACM
16 years 20 days ago
2008
ACM
Road network data is often incomplete, making it hard to perform network analysis. This paper discusses the problem of extending partial road networks with reasonable links, using...
110
Voted
SODA
1992
ACM
15 years 23 days 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 ...