Smallest enclosing ball for probabilistic data

DOI10.1145/2582112.2582114zbMath1395.68312OpenAlexW2157754768MaRDI QIDQ4635545

Alexander Munteanu, Dan Feldman, Christian Sohler

Publication date: 23 April 2018

Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2582112.2582114

zbMATH Keywords

samplingprobabilistic data1-mediansmallest enclosing ball

Mathematics Subject Classification ID

Directional data; spatial statistics (62H11) Geometric probability and stochastic geometry (60D05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (6)

Approximation algorithms for stochastic combinatorial optimization problems ⋮ Visibility testing and counting for uncertain segments ⋮ Clustering with faulty centers ⋮ Maximum box problem on stochastic points ⋮ Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems ⋮ Probabilistic smallest enclosing ball in high dimensions via subgradient sampling

This page was built for publication: Smallest enclosing ball for probabilistic data