839 search results - page 44 / 168 » Three-Clustering of Points in the Plane |
IPL
2002
13 years 8 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
CORR
1999
Springer
13 years 8 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
SIAMCOMP
1998
13 years 8 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
ICCV
2007
IEEE
14 years 11 months ago
2007
IEEE
We present the first method to compute depth cues from images taken solely under uncalibrated near point lighting. A stationary scene is illuminated by a point source that is move...
SMI
1999
IEEE
14 years 1 months ago
1999
IEEE
We discuss how to solve variational constraint problems involving points, lines and planes. We concentrate on small problems that must be solved simultaneously.