137 search results - page 10 / 28 » On polygons excluding point sets |
COMPGEOM
1990
ACM
13 years 11 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
CCCG
2006
13 years 8 months ago
2006
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
EJC
2008
13 years 7 months ago
2008
Let X be a set of points in general position in the plane. General position means that no three points lie on a line and no two points have the same x-coordinate. Y X is a cup, r...
IWANN
2001
Springer
13 years 11 months ago
2001
Springer
It is presented in this paper a new approach to the problem of feature extraction. The approach is based on the edge detection, where a set of feature vectors is taken from the sou...
COMGEO
1998
ACM
13 years 7 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...