Abstract
The present article discusses the number of empty convex 4-gons and empty convex 5-gons in a finite planar point set. New proofs are provided for the two related important results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. Hosono and M. Urabe,On the number of disjoint convex quadrilaterals for a planar point set, Computational Geometry20 (2001), 97–104.
H. Harborth,Konvexe Fünfecke in ebenen Punktmenger Elem. Math.,33 (1978), 116–118.
M. Urabe,On a partition into convex polygons, Discrete Appl. Math.,64 (1996), 179–191.
Xu Changqing and Ding Ren,On the empty convex partition of a finite set in the plane, Chin. Ann. Math.23 B:4 (2000), 487–494.
B. K. Kim,A lower bound for the convexity number of some graphs, J. Appl. Math. & Computing14 (1–2) (2004), 185–191
Mahnhoon Lee and Changhwa Kim,Some characterizations of doubly chordal graphs, J. Appl. Math. & Computing (old: KJCAM)5(1) (1998), 65–71
Author information
Authors and Affiliations
Corresponding authors
Additional information
This research was supported by Hebei NSF A2005000144.
Yatao Du received MSc and Ph. D. from the Hebei Normal University under the direction of Prof. Ren Ding. Her research interests focus on discrete geometry, convex geometry and combinatorial geometry.
Ren Ding is a professor of mathematics, supervising Ph. D. programs at Hebei Normal University. His research interests focus on discrete geometry, convex geometry and combinatorial geometry.
Rights and permissions
About this article
Cite this article
Du, Y., Ding, R. New proofs about the number of empty convex 4-gons and 5-gons in a planar point set. JAMC 19, 93–104 (2005). https://doi.org/10.1007/BF02935790
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02935790