138 search results - page 5 / 28 » K-Guarding Polygons on the Plane |
IVC
2007
13 years 7 months ago
2007
This paper tackles the problem of the computation of a planar polygonal curve from a digital planar curve, such that the digital data can be exactly retrieved from the polygonal c...
ICCSA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
IJCGA
2010
13 years 5 months ago
2010
For a set T of n points in a metric space (X, d), a point y X is dominated by a point x X if d(x, t) d(y, t) for all t T and there exists t T such that d(x, t ) < d(y, t )....
JMMA
2002
13 years 7 months ago
2002
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
CCCG
2010
13 years 9 months ago
2010
We show how to construct interlocked collections of simple polygons in the plane that fall apart upon removing certain combinations of pieces. Precisely, interiordisjoint simple p...