Pages that link to "Item:Q1037646"
From MaRDI portal
The following pages link to Delaunay triangulation of imprecise points in linear time after preprocessing (Q1037646):
Displaying 11 items.
- Data imprecision under \(\lambda\)-geometry model (Q527138) (← links)
- The maximal distance between imprecise point objects (Q533189) (← links)
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800) (← links)
- Minimizing the diameter of a spanning tree for imprecise points (Q1709600) (← links)
- COMPUTING THE DISCRETE FRÉCHET DISTANCE WITH IMPRECISE INPUT (Q4650089) (← links)
- Preprocessing Ambiguous Imprecise Points (Q5088972) (← links)
- The Most Likely Object to be Seen Through a Window (Q5149565) (← 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)
- (Q6179335) (← links)
- Minimizing query frequency to bound congestion potential for moving entities at a fixed target time (Q6546591) (← links)
