AbstractGiven n points in the plane, we partition them into three classes such that the maximum distance between two points in the same class is minimized. The algorithm takes O(n2log2n) time
AbstractThis paper considers the problem of partitioning a planar set of n points into two subsets s...
Clustering problems often arise in fields like data mining and machine learning. Clustering usually ...
In this thesis we study efficient computational methods for geometrical problems of practical import...
AbstractGiven n points in the plane, we partition them into three classes such that the maximum dist...
A k-clustering of a given set of points in the plane is a partition of the points into k subsets ("c...
A k-clustering of a given set of points in the plane is a partition of the points into k subsets (&...
AbstractThe problem of clustering a set of points so as to minimize the maximum intercluster distanc...
We study the min-size $k$-clustering problem, a geometric clustering problem which generalizes clust...
AbstractIn this paper, we consider the problem of clustering a set of n finite point-sets in d-dimen...
Let $S$ be a set of $n$ points in $d$-space and let $1 \leq k \leq n$ be an integer. A unified appro...
For a partition of an n-point set X ae R d into k subsets (clusters) S 1 ; S 2 ; : : : ; S k , we ...
Introduction Clustering is an important problem, with applications in areas such as data mining and...
Let P be a set of n points in the plane. We consider the problem of partitioning P into two subsets ...
This paper surveys how geometric information can be effectively used for efficient algorithms with f...
Motivated by an application from geodesy, we introduce a novel clustering problem which is a $k$-cen...
AbstractThis paper considers the problem of partitioning a planar set of n points into two subsets s...
Clustering problems often arise in fields like data mining and machine learning. Clustering usually ...
In this thesis we study efficient computational methods for geometrical problems of practical import...
AbstractGiven n points in the plane, we partition them into three classes such that the maximum dist...
A k-clustering of a given set of points in the plane is a partition of the points into k subsets ("c...
A k-clustering of a given set of points in the plane is a partition of the points into k subsets (&...
AbstractThe problem of clustering a set of points so as to minimize the maximum intercluster distanc...
We study the min-size $k$-clustering problem, a geometric clustering problem which generalizes clust...
AbstractIn this paper, we consider the problem of clustering a set of n finite point-sets in d-dimen...
Let $S$ be a set of $n$ points in $d$-space and let $1 \leq k \leq n$ be an integer. A unified appro...
For a partition of an n-point set X ae R d into k subsets (clusters) S 1 ; S 2 ; : : : ; S k , we ...
Introduction Clustering is an important problem, with applications in areas such as data mining and...
Let P be a set of n points in the plane. We consider the problem of partitioning P into two subsets ...
This paper surveys how geometric information can be effectively used for efficient algorithms with f...
Motivated by an application from geodesy, we introduce a novel clustering problem which is a $k$-cen...
AbstractThis paper considers the problem of partitioning a planar set of n points into two subsets s...
Clustering problems often arise in fields like data mining and machine learning. Clustering usually ...
In this thesis we study efficient computational methods for geometrical problems of practical import...
DOI
Add to ORKG