839 search results - page 17 / 168 » Three-Clustering of Points in the Plane |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Let V be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane 4 3 9 -spanner of the unit-disk graph UDG(V ). This algorithm makes only one ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...
JSYML
2008
13 years 7 months ago
2008
We consider a modal language for affine planes, with two sorts of formulas (for points and lines) and three modal boxes. To evaluate formulas, we regard an affine plane as a Kripke...
CAGD
2005
13 years 7 months ago
2005
We consider the interpolation of a given set of ordered space data points by a smooth curve in the presence ofa set offinite or infinite constraint planes, where the polyline join...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...