A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets

DOI10.1007/978-3-540-89550-3_10MaRDI QIDQ5302743zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Planar point sets with a small number of empty convex polygons
• Disjoint empty convex polygons in planar point sets
• On the minimum cardinality of a planar point set containing two disjoint convex polygons
• scientific article; zbMATH DE number 881170
• On empty convex polygons in a planar point set
• On empty convex polygons in a planar point set
• Planar point sets with large minimum convex decompositions
• A minimal planar point set containing a disjoint pair of a convex 4-gon and a convex 6-gon
• Planar sets with few empty convex polygons

Cites work

• Empty convex hexagons in planar point sets
• Finding sets of points without empty convex 6-gons
• scientific article; zbMATH DE number 1786502 (Why is no real title available?)
• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• Konvexe Fünfecke in ebenen Punktmengen
• Note on the Erdős-Szekeres theorem
• On a partition into convex polygons
• On some problems of elementary and combinatorial geometry
• 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
• Sets with No Empty Convex 7-Gons

Cited in

(17)

• Holes or empty pseudo-triangles in planar point sets
• A note on the value in the disjoint convex partition problem
• Disjoint empty convex pentagons in planar point sets
• Twenty years of progress of \(\mathrm{JCDCG}^3\)
• A note on the upper bound for disjoint convex partitions
• 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
• On the minimum cardinality of a planar point set containing two disjoint convex polygons
• On the minimum size of a point set containing three non-intersecting empty convex polygons.
• A note on point subset with a disjoint triple of two 4-holes and a 5-hole
• Planar point sets with a small number of empty convex polygons
• Disjoint empty convex polygons in planar point sets
• On disjoint holes in point sets
• On the minimum size of a point set containing a 5-hole and double disjoint 3-holes
• Two disjoint 5-holes in point sets
• On the minimum number of mutually disjoint holes in planar point sets

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

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