Static and dynamic algorithms for k-point clustering problems

DOI10.1007/3-540-57155-8_254zbMath1504.68251OpenAlexW1596202017MaRDI QIDQ5060119

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

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

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 (10)

Iterated nearest neighbors and finding minimal polytopes ⋮ Computing the smallest \(k\)-enclosing circle and related problems ⋮ Enclosing \(k\) points in the smallest axis parallel rectangle ⋮ Dynamic Euclidean minimum spanning trees and extrema of binary functions ⋮ On geometric optimization with few violated constraints ⋮ Faster geometric \(k\)-point MST approximation ⋮ Compact location problems ⋮ Polynomial time algorithms for three-label point labeling. ⋮ Optimal placement of convex polygons to maximize point containment ⋮ A near-linear algorithm for the planar segment-center problem

Cites Work

• Maintaining the minimal distance of a point set in polylogarithmic time
• Decomposable searching problems
• Finding k points with minimum diameter and related problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Static and dynamic algorithms for k-point clustering problems