839 search results - page 27 / 168 » Three-Clustering of Points in the Plane |
144
click to vote
ICCV
1998
IEEE
16 years 8 months ago
1998
IEEE
A novel approach to grouping symmetrical planar curves under a projective transform is described. Symmetric curves are important as a generic model for object recognition where an...
177
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
This paper describes a new method to recover the sign of the local Gaussian curvature at each point on the visible surface of a 3-D object. Multiple (p > 3) shaded images are a...
161
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
176
click to vote
ORDER
2010
15 years 4 months ago
2010
Let r(n) denote the largest integer such that every family C of n pairwise disjoint segments in the plane in general position has r(n) members whose order type can be represented ...
152
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
Let N be a nilpotent group normal in a group G. Suppose that G acts transitively upon the points of a finite non-Desarguesian projective plane P. We prove that, if P has square or...