Static and dynamic algorithms for k-point clustering problems
From MaRDI portal
Publication:5060119
DOI10.1007/3-540-57155-8_254zbMath1504.68251MaRDI QIDQ5060119
Amitava Datta, Michiel H. M. Smid, Hans-Peter Lenhof, Christian Schwarz
Publication date: 18 January 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-57155-8_254
68Q25: Analysis of algorithms and problem complexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W10: Parallel algorithms in computer science
68P05: Data structures
Related Items
Optimal placement of convex polygons to maximize point containment, Iterated nearest neighbors and finding minimal polytopes, Computing the smallest \(k\)-enclosing circle and related problems, Dynamic Euclidean minimum spanning trees and extrema of binary functions, Faster geometric \(k\)-point MST approximation, Compact location problems, Polynomial time algorithms for three-label point labeling., A near-linear algorithm for the planar segment-center problem, On geometric optimization with few violated constraints