Pages that link to "Item:Q1190511"
From MaRDI portal
The following pages link to Counting convex \(k\)-gons in planar point sets (Q1190511):
Displaying 10 items.
- On \(k\)-convex polygons (Q427049) (← links)
- Counting \(k\)-subsets and convex \(k\)-gons in the plane (Q1178214) (← links)
- Counting convex polygons in planar point sets (Q1350236) (← links)
- Forced convex \(n\)-gons in the plane (Q1387846) (← links)
- Faster counting empty convex polygons in a planar point set (Q2059898) (← links)
- On weighted sums of numbers of convex polygons in point sets (Q2167313) (← links)
- Which \(n\)-Venn diagrams can be drawn with convex \(k\)-gons? (Q2369930) (← links)
- New proofs about the number of empty convex 4-gons and 5-gons in a planar point set (Q2574327) (← links)
- Empty squares in arbitrary orientation among points (Q2700381) (← links)
- A simple aggregative algorithm for counting triangulations of planar point sets and related problems (Q5174454) (← links)
