Static and dynamic algorithms for k-point clustering problems

DOI10.1007/3-540-57155-8_254MaRDI QIDQ5060119zbMATH OpenOpenAlexFDO

Authors Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel Smid

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

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

Cites work

• Decomposable searching problems
• Finding k points with minimum diameter and related problems
• scientific article; zbMATH DE number 437530 (Why is no real title available?)
• scientific article; zbMATH DE number 1256675 (Why is no real title available?)
• Maintaining the minimal distance of a point set in polylogarithmic time

Cited in

(10)

• 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
• Enclosing k points in the smallest axis parallel rectangle

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060119)