138 search results - page 16 / 28 » K-Guarding Polygons on the Plane |
SODA
1996
ACM
13 years 9 months ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
COR
2006
13 years 7 months ago
2006
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at tw...
COMPGEOM
2007
ACM
13 years 11 months ago
2007
ACM
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
SIBGRAPI
1999
IEEE
13 years 12 months ago
1999
IEEE
This paper describes a real-time shadow generation algorithm for polygonal environments illuminated by movable point light sources. The main goal is to quickly reduce the number o...
ICMLA
2004
13 years 9 months ago
2004
This paper introduces a system, called PolyCluster, which adopts state-of-the-art algorithms for data visualization and integrates human domain knowledge into the construction pro...