839 search results - page 18 / 168 » Three-Clustering of Points in the Plane |
189
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
168
click to vote
WADS
2007
Springer
16 years 25 days ago
2007
Springer
Let G = (S, E) be a plane straight-line graph on a finite point set S ⊂ R2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges ...
186
click to vote
FSTTCS
2007
Springer
16 years 26 days ago
2007
Springer
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...
157
click to vote
COMPGEOM
1990
ACM
15 years 10 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
230
click to vote
GM
1999
Springer
15 years 11 months ago
1999
Springer
In many applications one is concerned with the approximation of functions from a finite set of scattered data sites with associated function values. We describe a scheme for cons...