A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets

DOI10.1007/978-3-540-89550-3_10zbMath1162.52302OpenAlexW1798441839MaRDI QIDQ5302743

Kiyoshi Hosono, Masatsugu Urabe

Publication date: 13 January 2009

Published in: Computational Geometry and Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89550-3_10

Mathematics Subject Classification ID

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

Related Items (9)

Two disjoint 5-holes in point sets ⋮ Disjoint empty disks supported by a point set ⋮ 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 ⋮ Twenty years of progress of \(\mathrm{JCDCG}^3\) ⋮ A note on the upper bound for disjoint convex partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some problems of elementary and combinatorial geometry
• Konvexe Fünfecke in ebenen Punktmengen
• Note on the Erdős-Szekeres theorem
• Finding sets of points without empty convex 6-gons
• On a partition into convex polygons
• Sets with No Empty Convex 7-Gons
• On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons
• On the number of disjoint convex quadrilaterals for a planar point set

This page was built for publication: A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets