Streaming and dynamic algorithms for minimum enclosing balls in high dimensions

DOI10.1016/j.comgeo.2013.05.007zbMath1281.65029OpenAlexW2055900608MaRDI QIDQ390131

Vinayak Pathak, Timothy M. Chan

Publication date: 22 January 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2013.05.007

zbMATH Keywords

dynamic algorithmsstreaming algorithmshigh dimensionminimum enclosing ball

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (6)

Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls ⋮ Constant work-space algorithms for facility location problems ⋮ An improved data stream algorithm for clustering ⋮ A streaming algorithm for 2-center with outliers in high dimensions ⋮ Covering convex polygons by two congruent disks ⋮ Covering convex polygons by two congruent disks

Cites Work

• Unnamed Item
• Unnamed Item
• Dynamic coresets
• Faster core-set constructions and data-stream algorithms in fixed dimensions
• Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
• Approximating extent measures of points
• An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
• Approximate clustering via core-sets
• A space-optimal data-stream algorithm for coresets in the plane
• Decomposable searching problems I. Static-to-dynamic transformation
• Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions
• Approximate minimum enclosing balls in high dimensions using core-sets

This page was built for publication: Streaming and dynamic algorithms for minimum enclosing balls in high dimensions