Sciweavers

137 search results - page 2 / 28
» On polygons excluding point sets
Sort
View
COMPGEOM
2004
ACM
13 years 10 months ago
Separating point sets in polygonal environments
We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the inte...
Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Jo...
COMPGEOM
2004
ACM
13 years 10 months ago
On empty convex polygons in a planar point set
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
Rom Pinchasi, Rados Radoicic, Micha Sharir
CCCG
2001
13 years 6 months ago
Translational polygon covering using intersection graphs
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
Karen Daniels, Rajasekhar Inkulu
RT
2000
Springer
13 years 9 months ago
Exact Illumination in Polygonal Environments using Vertex Tracing
Abstract. Methods for exact computation of irradiance and form factors associated with polygonal objects have ultimately relied on a formula for a differential area to polygon form...
Michael M. Stark, Richard F. Riesenfeld