On the number of disjoint convex quadrilaterals for a planar point set
From MaRDI portal
(Redirected from Publication:5952583)
Recommendations
Cites work
Cited in
(22)- On polygons enclosing point sets. II
- Characterizing and efficiently computing quadrangulations of planar point sets
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
- A note on the value in the disjoint convex partition problem
- Disjoint empty convex pentagons in planar point sets
- A note on the upper bound for disjoint convex partitions
- Counting disjoint 2-partitions for points in the plane
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
- New proofs about the number of empty convex 4-gons and 5-gons in a planar point set
- On the number of crossing-free partitions
- On pseudo-convex partitions of a planar point set
- The Erdos-Szekeres problem on points in convex position – a survey
- A bound on a convexity measure for point sets
- Specified holes with pairwise disjoint interiors in planar point sets
- A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets
- More on empty convex quadrilaterals in a planar point set
- On disjoint holes in point sets
- On the minimum size of a point set containing a 5-hole and double disjoint 3-holes
- Two disjoint 5-holes in point sets
- On the minimum number of mutually disjoint holes in planar point sets
- Cells in any simple polygon formed by a planar point set
- On the number of empty convex quadrilaterals of a finite set in the plane
This page was built for publication: On the number of disjoint convex quadrilaterals for a planar point set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952583)