138 search results - page 12 / 28 » K-Guarding Polygons on the Plane |
ALGORITHMICA
1998
13 years 7 months ago
1998
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
GC
2007
Springer
13 years 7 months ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
CG
2002
Springer
13 years 7 months ago
2002
Springer
We present an algorithm for computing a robust adaptive polygonal approximation of an implicit curve in the plane. The approximation is adapted to the geometry of the curve because...
COMPGEOM
1991
ACM
13 years 11 months ago
1991
ACM
Given a simple polygon in the plane with two distinguished vertices, s and g, is it possible for two guards to simultaneously walk along the two boundary chains from s to g in suc...
FCS
2006
13 years 9 months ago
2006
In this paper, we concentrate on the problem of computing a Voronoi diagram using Hypercube model of computation. The main contribution of this work is the O(log3 n) parallel algor...