839 search results - page 8 / 168 » Three-Clustering of Points in the Plane |
COMPGEOM
2010
ACM
14 years 23 days ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
DCG
2008
13 years 7 months ago
2008
The visibility graph V(X) of a discrete point set X R2 has vertex set X and an edge xy for every two points x, y X whenever there is no other point in X on the line segment betw...
CAGD
2004
13 years 7 months ago
2004
Given a set of data points as measurements from a developable surface, the present paper investigates the recognition and reconstruction of these objects. We investigate the set o...
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of pose estimation of a known object. We present a framework tha...
CJCDGCGT
2005
Springer
14 years 1 months ago
2005
Springer
