Static and Dynamic Algorithms for k-Point Clustering Problems

DOI10.1006/jagm.1995.1048zbMath0836.68115OpenAlexW2065967395MaRDI QIDQ4857543

Amitava Datta, Christian Schwarz, Michiel H. M. Smid, Hans-Peter Lenhof

Publication date: 11 April 1996

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1995.1048

zbMATH Keywords

data structuresclustering problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items

Computing the Smallest T-Shaped Polygon Containing k Points, A new approximation algorithm for labeling points with circle pairs, Approximation and inapproximability results for maximum clique of disc graphs in high dimensions, A branch-and-bound method for the minimum \(k\)-enclosing ball problem, Cluster analysis and mathematical programming, Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon, On finding a large number of 3D points with a small diameter, On enclosing k points by a circle, Discrete Voronoi games and \(\epsilon\)-nets, in two and three dimensions, GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON, A combinatorial theorem on labeling squares with points and its application, EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING, LABELING POINTS WITH CIRCLES, Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points, Region-restricted clustering for geographic data mining, Unnamed Item, Smallest \(k\)-enclosing rectangle revisited, A simple factor-3 approximation for labeling points with circles, Smallest k-enclosing rectangle revisited, A (slightly) faster algorithm for Klee's measure problem, Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation, Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points, Complexity and approximation of the smallest \(k\)-enclosing ball problem