Streaming and dynamic algorithms for minimum enclosing balls in high dimensions

DOI10.1016/J.COMGEO.2013.05.007MaRDI QIDQ390131zbMATH OpenOpenAlexFDO

Authors Timothy M. Chan, Vinayak Pathak

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 algorithmshigh dimensionminimum enclosing ballstreaming algorithms

Mathematics Subject Classification ID

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

Recommendations

• Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
• scientific article; zbMATH DE number 6297803
• Streaming algorithms for extent problems in high dimensions
• Approximate minimum enclosing balls in high dimensions using core-sets
• Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls

Cites work

• A space-optimal data-stream algorithm for coresets in the plane
• An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
• Approximate clustering via core-sets
• Approximate minimum enclosing balls in high dimensions using core-sets
• Approximating extent measures of points.
• Decomposable searching problems I. Static-to-dynamic transformation
• Dynamic coresets
• Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
• Faster core-set constructions and data-stream algorithms in fixed dimensions
• scientific article; zbMATH DE number 2079414 (Why is no real title available?)
• scientific article; zbMATH DE number 6297803 (Why is no real title available?)
• Streaming and dynamic algorithms for minimum enclosing balls in high dimensions

Cited in

(11)

• Constant work-space algorithms for facility location problems
• Streaming algorithms for extent problems in high dimensions
• Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls
• Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
• scientific article; zbMATH DE number 6297803 (Why is no real title available?)
• Algorithms - ESA 2003
• Covering convex polygons by two congruent disks
• Covering convex polygons by two congruent disks
• A streaming algorithm for 2-center with outliers in high dimensions
• Static and streaming data structures for Fréchet distance queries
• An improved data stream algorithm for clustering

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

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