The following pages link to Convex hulls under uncertainty (Q2408916):
Displaying 23 items.
- Computing the center of uncertain points on tree networks (Q527423) (← links)
- On the separability of stochastic geometric objects, with applications (Q1615884) (← links)
- Largest and smallest area triangles on imprecise points (Q1984599) (← links)
- Euclidean minimum spanning trees with independent and dependent geometric uncertainties (Q1984604) (← links)
- Computing Shapley values in the plane (Q2118220) (← links)
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points (Q2304571) (← links)
- The most-likely skyline problem for stochastic points (Q2306361) (← links)
- On the expected diameter, width, and complexity of a stochastic convex hull (Q2331212) (← links)
- Separability of imprecise points (Q2362104) (← links)
- On the arrangement of stochastic lines in \(\mathbb{R}^2\) (Q2363351) (← links)
- (Q2921391) (redirect page) (← links)
- Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points (Q3448848) (← links)
- Computing the Center of Uncertain Points on Tree Networks (Q3449857) (← links)
- Computing the Expected Value and Variance of Geometric Measures (Q4555539) (← links)
- Computing the Rectilinear Center of Uncertain Points in the Plane (Q4557735) (← links)
- Cardinality estimation for random stopping sets based on Poisson point processes (Q4990911) (← links)
- Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties (Q5072221) (← links)
- (Q5088947) (← links)
- r-Gatherings on a star and uncertain r-gatherings on a line (Q5101887) (← links)
- (Q5115783) (← links)
- The Most Likely Object to be Seen Through a Window (Q5149565) (← links)
- Covering uncertain points in a tree (Q5920112) (← links)
- Half-plane point retrieval queries with independent and dependent geometric uncertainties (Q6110075) (← links)
