Computational geometry: an introduction
Computational geometry: an introduction
The NP-completeness column: an ongoing guide
Journal of Algorithms
Computing Euclidean maximum spanning trees
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Clustering Algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Computing Euclidean maximum spanning trees
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Fining k points with minimum spanning trees and related problems
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Transitions in geometric minimum spanning trees (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Average case analysis of dynamic geometric optimization
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A unified approach for solving bottleneck k-bipartition problems
CSC '91 Proceedings of the 19th annual conference on Computer Science
Smallest k-point enclosing rectangle and square of arbitrary orientation
Information Processing Letters
Efficient data dissemination using locale covers
Pervasive and Mobile Computing
A linear-space algorithm for distance preserving graph embedding
Computational Geometry: Theory and Applications
Spanning Tree Based Attribute Clustering
PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Smallest k-point enclosing rectangle and square of arbitrary orientation
Information Processing Letters
A decomposition algorithm for learning Bayesian network structures from data
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
k-enclosing axis-parallel square
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Clustering and outlier detection using isoperimetric number of trees
Pattern Recognition
| Hi-index | 0.00 |
We consider clustering problems under two different optimization criteria. One is to minimize the maximum intracluster distance (diameter), and the other is to maximize the minimum intercluster distance. In particular, we present an algorithm which partitions a set S of n points in the plane into two subsets so that their larger diameter is minimized in time &Ogr;(n log n) and space &Ogr;(n). Another algorithm with the same bounds computes a k-partition of S for any k so that the minimum intercluster distance is maximized. In both instances it is first shown that an optimal parition is determined by either a maximum or minimum spanning tree of S.