On the empty convex partition of a finite set in the plane.
From MaRDI portal
Publication:1861024
The authors discuss partitions of a finite set of points in the plane into empty convex polygons and into disjoint convex polygons. They improve upper and lower bounds in enumeration problems stated in [\textit{M. Urabe}, Discrete Appl. Math. 64, 179--191 (1996; Zbl 0849.52015)].
Recommendations
- scientific article; zbMATH DE number 1150145
- Partition of a plane set into a finite number of d-convex parts
- Perfect partitions of convex sets in the plane
- On the number of empty convex quadrilaterals of a finite set in the plane
- scientific article; zbMATH DE number 2076405
- On empty convex polygons in a planar point set
- On empty convex polygons in a planar point set
- On pseudo-convex partitions of a planar point set
- scientific article; zbMATH DE number 3964348
- On empty convex polytopes
Cited in
(8)- Disjoint empty convex pentagons in planar point sets
- New proofs about the number of empty convex 4-gons and 5-gons in a planar point set
- Partition of a plane set into a finite number of d-convex parts
- On pseudo-convex partitions of a planar point set
- scientific article; zbMATH DE number 1150145 (Why is no real title available?)
- Partitioning a planar point set into empty convex polygons
- On the number of disjoint convex quadrilaterals for a planar point set
- Finite nondense point set analysis
This page was built for publication: On the empty convex partition of a finite set in the plane.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1861024)