Clustering motion

DOI10.1007/s00454-004-2822-7zbMath1094.68103OpenAlexW2911597709MaRDI QIDQ1889914

Sariel Har-Peled

Publication date: 13 December 2004

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-004-2822-7

zbMATH Keywords

clustering algorithmsstatic clustering

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (13)

Dynamic coresets ⋮ Kinetic clustering of points on the line ⋮ Trajectory clustering of points in \(\mathbb{R}\) ⋮ Covering moving points with anchored disks ⋮ THE ALIGNED K-CENTER PROBLEM ⋮ Light Euclidean Spanners with Steiner Points ⋮ High-dimensional approximate \(r\)-nets ⋮ Kinetic facility location ⋮ Approximation algorithm for the kinetic robust \(k\)-center problem ⋮ A FAST k-MEANS IMPLEMENTATION USING CORESETS ⋮ Unnamed Item ⋮ Aggregation error for location models: Survey and analysis ⋮ A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM

This page was built for publication: Clustering motion