Pages that link to "Item:Q676573"
From MaRDI portal
The following pages link to Sequential and parallel algorithms for finding a maximum convex polygon (Q676573):
Displaying 5 items.
- Computing optimal islands (Q433119) (← links)
- Lower bounds for the number of hyperplanes separating two finite sets of points (Q492284) (← links)
- New results on the coarseness of bicolored point sets (Q522958) (← links)
- Approximation of convex sets by polytopes (Q2519248) (← links)
- Peeling Potatoes Near-Optimally in Near-Linear Time (Q5363383) (← links)
