The following pages link to Computing optimal islands (Q433119):
Displaying 11 items.
- New results on stabbing segments with a polygon (Q474818) (← links)
- New results on the coarseness of bicolored point sets (Q522958) (← links)
- Computing the coarseness with strips or boxes (Q526818) (← links)
- Optimum turn-restricted paths, nested compatibility, and optimum convex polygons (Q724738) (← links)
- On weighted sums of numbers of convex polygons in point sets (Q2167313) (← links)
- Carathéodory's theorem in depth (Q2408186) (← links)
- Maximum-weight planar boxes in \(O(n^2)\) time (and better) (Q2448119) (← links)
- On rainbow quadrilaterals in colored point sets (Q2676756) (← links)
- Maximum Rectilinear Convex Subsets (Q5149759) (← links)
- Peeling Potatoes Near-Optimally in Near-Linear Time (Q5363383) (← links)
- Monochromatic partitioning of colored points by lines (Q6161462) (← links)
