Computing the Expected Value and Variance of Geometric Measures
From MaRDI portal
Publication:4555539
DOI10.1145/3228331zbMath1430.68386arXiv1610.03788OpenAlexW2537323706WikidataQ129560119 ScholiaQ129560119MaRDI QIDQ4555539
Frank Staals, Constantinos P. Tsirogiannis, Vincent Pellissier
Publication date: 20 November 2018
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.03788
Applications of statistics to biology and medical sciences; meta analysis (62P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Ecology (92D40) Approximation algorithms (68W25)
Related Items (2)
Maximum box problem on stochastic points ⋮ Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Largest and smallest convex hulls for imprecise points
- An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\).
- Expected computations on color spanning sets
- Convex hulls under uncertainty
- An efficient algorithm for determining the convex hull of a finite planar set
- On the Most Likely Convex Hull of Uncertain Points
- Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points
- On Approximating the Average Distance Between Points
- Shape Fitting on Point Sets with Probability Distributions
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Geometric Computations on Indecisive Points
- Probability Inequalities for Sums of Bounded Random Variables
This page was built for publication: Computing the Expected Value and Variance of Geometric Measures