Pages that link to "Item:Q5390584"
From MaRDI portal
The following pages link to Preprocessing Imprecise Points and Splitting Triangulations (Q5390584):
Displaying 11 items.
- Closest pair and the post office problem for stochastic points (Q390124) (← links)
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800) (← links)
- Delaunay triangulation of imprecise points in linear time after preprocessing (Q1037646) (← links)
- Minimizing the diameter of a spanning tree for imprecise points (Q1709600) (← links)
- Preclustering algorithms for imprecise points (Q2144264) (← links)
- Nearest-neighbor searching under uncertainty. I (Q2411831) (← links)
- (Q2968075) (← links)
- Delaunay triangulations of imprecise pointsin linear time after preprocessing (Q3602931) (← links)
- Preprocessing Ambiguous Imprecise Points (Q5088972) (← links)
- Computing the Fréchet distance between uncertain curves in one dimension (Q5896889) (← links)
- Computing the Fréchet distance between uncertain curves in one dimension (Q5918556) (← links)