On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons
From MaRDI portal
Publication:5449760
DOI10.1007/11589440_12zbMath1136.52311OpenAlexW1561962265MaRDI QIDQ5449760
Masatsugu Urabe, Kiyoshi Hosono
Publication date: 18 March 2008
Published in: Discrete and Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11589440_12
Exact enumeration problems, generating functions (05A15) Computational aspects related to convexity (52B55) Erd?s problems and related topics of discrete geometry (52C10) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)
Related Items (8)
Two disjoint 5-holes in point sets ⋮ A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets ⋮ On pseudo-convex partitions of a planar point set ⋮ 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 minimum size of a point set containing a 5-hole and double disjoint 3-holes ⋮ A note on the upper bound for disjoint convex partitions
This page was built for publication: On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons
