Pages that link to "Item:Q5199272"
From MaRDI portal
The following pages link to Closest Pair and the Post Office Problem for Stochastic Points (Q5199272):
Displayed 12 items.
- One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
- Computing the center of uncertain points on tree networks (Q527423) (← links)
- Euclidean minimum spanning trees with independent and dependent geometric uncertainties (Q1984604) (← links)
- Expected computations on color spanning sets (Q2343982) (← links)
- Nearest-neighbor searching under uncertainty. I (Q2411831) (← 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 Rectilinear Center of Uncertain Points in the Plane (Q4557735) (← links)
- Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties (Q5072221) (← links)
- Covering uncertain points in a tree (Q5920112) (← links)
- Clustering with faulty centers (Q6092308) (← links)
- Half-plane point retrieval queries with independent and dependent geometric uncertainties (Q6110075) (← links)