138 search results - page 26 / 28 » K-Guarding Polygons on the Plane |
121
click to vote
WG
2010
Springer
15 years 5 days ago
2010
Springer
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
101
click to vote
CCCG
1993
15 years 3 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 ...
127
click to vote
SODA
1993
ACM
15 years 3 months ago
1993
ACM
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
109
click to vote
COMPGEOM
2007
ACM
15 years 5 months ago
2007
ACM
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
116
click to vote
COMPGEOM
2008
ACM
15 years 3 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...