A note on the upper bound for disjoint convex partitions
From MaRDI portal
Publication:2342363
DOI10.1134/S0001434614070281zbMath1316.52001MaRDI QIDQ2342363
Publication date: 11 May 2015
Published in: Mathematical Notes (Search for Journal in Brave)
Related Items (1)
Cites Work
- Konvexe Fünfecke in ebenen Punktmengen
- On a partition into convex polygons
- Disjoint empty convex pentagons in planar point sets
- The empty hexagon theorem
- Empty convex hexagons in planar point sets
- Computer solution to the 17-point Erdős-Szekeres problem
- Reconfirmation of Two Results on Disjoint Empty Convex Polygons
- Sets with No Empty Convex 7-Gons
- A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets
- On the minimum size of a point set containing a 5-hole and a disjoint 4-hole
- On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons
- On the number of disjoint convex quadrilaterals for a planar point set
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A note on the upper bound for disjoint convex partitions