839 search results - page 36 / 168 » Three-Clustering of Points in the Plane |
MOC
2010
13 years 3 months ago
2010
We introduce the concept of regular super-functions at a fixed point. It is derived from the concept of regular iteration. A super-function F of h is a solution of F(z+1)=h(F(z)). ...
WADS
2005
Springer
14 years 2 months ago
2005
Springer
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
COMGEO
2011
ACM
13 years 4 months ago
2011
ACM
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of n vertices in the plane, where each ray starts at t...
CCCG
2008
13 years 10 months ago
2008
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of poin...