New proofs about the number of empty convex 4-gons and 5-gons in a planar point set

DOI10.1007/BF02935790zbMath1080.52507OpenAlexW1967761664MaRDI QIDQ2574327

Yatao Du, Ren Ding

Publication date: 21 November 2005

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02935790

zbMATH Keywords

convex partitiondisjoint partitioncutting line

Mathematics Subject Classification ID

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

Related Items (1)

Every large point set contains many collinear points or an empty pentagon

Cites Work

• Unnamed Item
• Konvexe Fünfecke in ebenen Punktmengen
• A lower bound for the convexity number of some graphs
• On the empty convex partition of a finite set in the plane.
• On a partition into convex polygons
• On the number of disjoint convex quadrilaterals for a planar point set

This page was built for publication: New proofs about the number of empty convex 4-gons and 5-gons in a planar point set