839 search results - page 160 / 168 » Three-Clustering of Points in the Plane |
TCAD
2008
13 years 7 months ago
2008
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
JMM2
2007
13 years 7 months ago
2007
—When automatically analyzing images of human faces, either for recognition in biometry applications or facial expression analysis in human machine interaction, one has to cope w...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
TALG
2008
13 years 7 months ago
2008
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
ICCV
2009
IEEE
15 years 20 days ago
2009
IEEE
We describe a method for producing a smooth, stabilized
video from the shaky input of a hand-held light field video camera—
specifically, a small camera array. Traditional stab...