Pages that link to "Item:Q2849366"
From MaRDI portal
The following pages link to On the Most Likely Convex Hull of Uncertain Points (Q2849366):
Displaying 22 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)
- Minimum color spanning circle of imprecise points (Q2166769) (← 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)
- Expected computations on color spanning sets (Q2343982) (← links)
- Separability of imprecise points (Q2362104) (← links)
- On the arrangement of stochastic lines in \(\mathbb{R}^2\) (Q2363351) (← links)
- Convex hulls under uncertainty (Q2408916) (← links)
- On the Most Likely Voronoi Diagram and Nearest Neighbor Searching (Q2988722) (← 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)
- (Q4909818) (← links)
- Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties (Q5072221) (← links)
- The Most Likely Object to be Seen Through a Window (Q5149565) (← links)
- Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model (Q5862343) (← links)
- (Q5875491) (← links)
- Maximum box problem on stochastic points (Q5918465) (← links)
- Covering uncertain points in a tree (Q5920112) (← links)
