Pages that link to "Item:Q5757883"
From MaRDI portal
The following pages link to Largest and Smallest Tours and Convex Hulls for Imprecise Points (Q5757883):
Displayed 8 items.
- Query-competitive algorithms for cheapest set problems under uncertainty (Q899309) (← links)
- Triangulating input-constrained planar point sets (Q975526) (← links)
- Expected computations on color spanning sets (Q2343982) (← links)
- Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments (Q3183469) (← links)
- Approximating Largest Convex Hulls for Imprecise Points (Q5443375) (← 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)
- Fréchet Distance for Uncertain Curves (Q6051994) (← links)