839 search results - page 60 / 168 » Three-Clustering of Points in the Plane |
173
click to vote
SODA
1997
ACM
15 years 7 months ago
1997
ACM
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
146
click to vote
SMC
2007
IEEE
16 years 13 days ago
2007
IEEE
— An important consideration in clustering is the determination of the correct number of clusters and the appropriate partitioning of a given data set. In this paper, a newly dev...
147
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
160
click to vote
COMPGEOM
2009
ACM
16 years 21 days ago
2009
ACM
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
165
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...