On the minimum number of mutually disjoint holes in planar point sets

DOI10.1016/j.comgeo.2015.07.001zbMath1331.52024OpenAlexW1193275511MaRDI QIDQ904107

Kiyoshi Hosono

Publication date: 15 January 2016

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2015.07.001

zbMATH Keywords

empty convex polygonmutually disjoint holespartitions of a planar point set

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Convex sets in (2) dimensions (including convex curves) (52A10)

Cites Work

• Konvexe Fünfecke in ebenen Punktmengen
• Forced convex \(n\)-gons in the plane
• Finding convex sets among points in the plane
• Note on the Erdős-Szekeres theorem
• Finding sets of points without empty convex 6-gons
• On a partition into convex polygons
• The empty hexagon theorem
• Empty convex hexagons in planar point sets
• Computer solution to the 17-point Erdős-Szekeres problem
• Sets with No Empty Convex 7-Gons
• Discrete and Computational Geometry
• On the number of disjoint convex quadrilaterals for a planar point set
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the minimum number of mutually disjoint holes in planar point sets