Pages that link to "Item:Q1350236"
From MaRDI portal
The following pages link to Counting convex polygons in planar point sets (Q1350236):
Displaying 16 items.
- On balanced 4-holes in bichromatic point sets (Q482334) (← links)
- Searching for empty convex polygons (Q911758) (← links)
- Counting \(k\)-subsets and convex \(k\)-gons in the plane (Q1178214) (← links)
- Counting convex \(k\)-gons in planar point sets (Q1190511) (← links)
- The order of points on the second convex hull of a simple polygon (Q1895970) (← links)
- Generating random polygons with given vertices (Q1924712) (← links)
- A combinatorial property on angular orders of plane point sets (Q1944953) (← links)
- Algorithmic enumeration of surrounding polygons (Q1983143) (← 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)
- Empty squares in arbitrary orientation among points (Q2700381) (← links)
- REGULAR ENUMERATION OF GRID POINTS IN A CONVEX POLYGON (Q4294717) (← links)
- Convex polygons in Cartesian products (Q5088949) (← links)
- Convex partial transversals of planar regions (Q5091044) (← links)
- A simple aggregative algorithm for counting triangulations of planar point sets and related problems (Q5174454) (← links)
- Erdős-Szekeres-type problems in the real projective plane (Q6642299) (← links)
