13 search results - page 2 / 3 » Optimal Placement of Convex Polygons to Maximize Point Conta... |
ICCSA
2004
Springer
13 years 10 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...
ESA
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. A mobile robot, represented by a point moving along a polygonal line in the plane, has to explore an unknown polygon and return to the starting point. The robot has a sen...
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
ICRA
1994
IEEE
13 years 9 months ago
1994
IEEE
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...
CONEXT
2006
ACM
13 years 11 months ago
2006
ACM
Confronted with the generalization of monitoring in operational networks, researchers have proposed placement algorithms that can help ISPs deploy their monitoring infrastructure ...