The following pages link to Searching for empty convex polygons (Q911758):
Displaying 12 items.
- Recognition of largest empty orthoconvex polygon in a point set (Q407528) (← links)
- Every large point set contains many collinear points or an empty pentagon (Q659671) (← links)
- Finding minimum area \(k\)-gons (Q1186081) (← links)
- Finding minimum area simple pentagons (Q1267196) (← links)
- On empty convex polytopes (Q1346996) (← links)
- A combinatorial property on angular orders of plane point sets (Q1944953) (← links)
- Largest and smallest area triangles on imprecise points (Q1984599) (← links)
- Faster counting empty convex polygons in a planar point set (Q2059898) (← links)
- Starshaped sets (Q2216442) (← links)
- Empty squares in arbitrary orientation among points (Q2700381) (← links)
- The Erdos-Szekeres problem on points in convex position – a survey (Q4501063) (← links)
- (Q5743438) (← links)