99 search results - page 11 / 20 » On empty convex polygons in a planar point set |
145
click to vote
CCCG
2010
15 years 7 months ago
2010
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
104
click to vote
ICPR
2002
IEEE
15 years 11 months ago
2002
IEEE
We develop a wearable vision system that consists of a user’s visual direction sensor and stereo cameras. First, we establish a method for calibrating the system so that it can ...
189
click to vote
WADS
2009
Springer
16 years 19 days ago
2009
Springer
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
157
click to vote
CCCG
2010
15 years 7 months ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
160
click to vote
COMGEO
1998
ACM
15 years 5 months ago
1998
ACM
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximumnumber of combinatorial chan...