On a partition into convex polygons
From MaRDI portal
Publication:1917247
DOI10.1016/0166-218X(94)00120-3zbMath0849.52015OpenAlexW2007033927MaRDI QIDQ1917247
Publication date: 7 July 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(94)00120-3
Partitions of sets (05A18) Erd?s problems and related topics of discrete geometry (52C10) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (21)
A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets ⋮ On pseudo-convex partitions of a planar point set ⋮ The Mathematics of Ferran Hurtado: A Brief Survey ⋮ Tropical combinatorial Nullstellensatz and sparse polynomials ⋮ Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set ⋮ On the minimum number of mutually disjoint holes in planar point sets ⋮ Chromatic variants of the Erdős--Szekeres theorem on points in convex position. ⋮ Bottleneck convex subsets: finding \(k\) large convex sets in a point set ⋮ Construction and Local Routing for Angle-Monotone Graphs ⋮ A Bound on a Convexity Measure for Point Sets ⋮ Decompositions, partitions, and coverings with convex polygons and pseudo-triangles ⋮ Specified holes with pairwise disjoint interiors in planar point sets ⋮ A note on the value in the disjoint convex partition problem ⋮ Disjoint empty convex pentagons in planar point sets ⋮ On the number of disjoint convex quadrilaterals for a planar point set ⋮ On the number of empty convex quadrilaterals of a finite set in the plane ⋮ On the minimum size of a point set containing a 5-hole and double disjoint 3-holes ⋮ New proofs about the number of empty convex 4-gons and 5-gons in a planar point set ⋮ A note on the upper bound for disjoint convex partitions ⋮ The Erdos-Szekeres problem on points in convex position – a survey ⋮ On the empty convex partition of a finite set in the plane.
Cites Work
This page was built for publication: On a partition into convex polygons
