On the minimum size of a point set containing three non-intersecting empty convex polygons.

MaRDI QIDQ5206413zbMATH OpenFDO

Authors Lingling Liu, Yuqin Zhang

Publication date 18 December 2019

zbMATH Keywords

\(k\)-holediscrete geometrydisjoint convex polygons

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Recommendations

• On the minimum size of a point set containing a 5-hole and double disjoint 3-holes
• A minimal planar point set containing a disjoint triple of a 3-hole, a 4-hole and a 5-hole
• On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons
• A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets
• Reconfirmation of Two Results on Disjoint Empty Convex Polygons

Cited in

(4)

• The characterization of cones as pointsets with 3 intersection numbers
• Reconfirmation of Two Results on Disjoint Empty Convex Polygons
• On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons
• On the minimum size of a point set containing a 5-hole and double disjoint 3-holes

This page was built for publication: On the minimum size of a point set containing three non-intersecting empty convex polygons.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206413)