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 9 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)
- Parallel algorithms for separation of two sets of points and recognition of digital convex polygons (Q685228) (← links)
- Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (Q919827) (← links)
- Approximation of convex sets by polytopes (Q2519248) (← links)
- Linear algorithm to find the largest intriangles of a planar convex polygon (Q4246478) (← links)
- (Q4284244) (← links)
- Peeling Potatoes Near-Optimally in Near-Linear Time (Q5363383) (← links)