839 search results - page 134 / 168 » Three-Clustering of Points in the Plane |
COMPGEOM
2007
ACM
13 years 12 months ago
2007
ACM
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
CVPR
2003
IEEE
15 years 3 days ago
2003
IEEE
Monitoring activities using video data is an important surveillance problem. A special scenario is to learn the pattern of normal activities and detect abnormal events from a very...
ICPR
2008
IEEE
14 years 11 months ago
2008
IEEE
This paper presents a method for triangulation of 3D points given their projections in two images. Recent results show that the triangulation mapping can be represented as a linea...
COMPGEOM
2009
ACM
14 years 4 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
SMI
2008
IEEE
14 years 4 months ago
2008
IEEE
The distribution of geometric features is anisotropic by its nature. Intrinsic properties of surfaces such as normal curvatures, for example, varies with direction. In this paper ...