Kinetic clustering of points on the line

DOI10.1016/j.tcs.2016.05.020zbMath1344.68258arXiv1512.04303OpenAlexW2962679601MaRDI QIDQ301594

Marcio T. I. Oshiro, Cristina G. Fernandes

Publication date: 30 June 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.04303

zbMATH Keywords

computational geometryapproximation algorithmskinetic clusteringline trajectory

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Clustering to minimize the maximum intercluster distance
• Some dynamic computational geometry problems
• Easy and hard bottleneck location problems
• Discrete mobile centers
• Smooth kinetic maintenance of clusters
• Clustering motion
• Deformable spanners and applications
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Computational Geometry in C
• Data Structures for Mobile Data
• On stirling numbers of the second kind