138 search results - page 10 / 28 » K-Guarding Polygons on the Plane |
CCCG
2009
13 years 5 months ago
2009
We consider a special class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key with...
COMPGEOM
1997
ACM
13 years 12 months ago
1997
ACM
We consider the family of area bisectors of a polygon possibly with holes in the plane. We say that two bisectors of a polygon P are combinatorially distinct if they induce di e...
CCCG
2003
13 years 9 months ago
2003
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...
WSCG
2004
13 years 9 months ago
2004
A geometrical modelling tool allowing construction of models of living cells and their organelles would facilitate understanding of biological processes at the cellular level. Her...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...