Pages that link to "Item:Q1002103"
From MaRDI portal
The following pages link to Approximating largest convex hulls for imprecise points (Q1002103):
Displaying 9 items.
- New results on stabbing segments with a polygon (Q474818) (← links)
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
- On the power of the semi-separated pair decomposition (Q1947974) (← links)
- Minimum color spanning circle of imprecise points (Q2166769) (← links)
- Largest bounding box, smallest diameter, and related problems on imprecise points (Q2269143) (← links)
- Convex hulls under uncertainty (Q2408916) (← links)
- Visibility testing and counting for uncertain segments (Q2420576) (← links)
- Minimum-perimeter intersecting polygons (Q2429366) (← links)
- On the Power of the Semi-Separated Pair Decomposition (Q3183436) (← links)
