839 search results - page 12 / 168 » Three-Clustering of Points in the Plane |
EOR
2010
13 years 7 months ago
2010
For a finite set of points S, the (monochromatic) Reverse Nearest Neighbor (RNN) rule associates with any query point q the subset of points in S that have q as its nearest neighb...
COMGEO
2006
ACM
13 years 7 months ago
2006
ACM
Let S be a finite set of points in the plane and let T (S) be the set of intersection points between pairs of lines passing through any two points in S. We characterize all configu...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
Let P be a set of n points in Ê3 , not all in a common plane. We solve a problem of Scott (1970) by showing that the connecting lines of P assume at least 2n − 7 different dir...
BMVC
2001
13 years 10 months ago
2001
A method for the fronto-parallel recovery of paragraphs of text under full perspective transformation is presented. The horizontal vanishing point of the text plane is found using...
JGAA
2008
13 years 7 months ago
2008
In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and all facial cycles are drawn as convex polygons. In a convex gr...