共 50 条
- [1] On the minimum size of a point set containing two non-intersecting empty convex polygons [J]. DISCRETE AND COMPUTATIONAL GEOMETRY, 2005, 3742 : 117 - 122
- [3] Partitioning a planar point set into empty convex polygons [J]. DISCRETE AND COMPUTATIONAL GEOMETRY, 2002, 2866 : 129 - 134
- [4] On the number of disjoint convex quadrilaterals for a planar point set [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2001, 20 (03): : 97 - 104
- [5] A Note on the Minimum Size of a Point Set Containing Three Nonintersecting Empty Convex Polygons [J]. SYMMETRY-BASEL, 2018, 10 (10):
- [8] A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets [J]. COMPUTATIONAL GEOMETRY AND GRAPH THEORY, 2008, 4535 : 90 - 100
- [9] CONVEX POLYGONS DETERMINED BY A FINITE PLANAR SET [J]. AMERICAN MATHEMATICAL MONTHLY, 1974, 81 (07): : 749 - 752
- [10] Reconfirmation of two results on disjoint empty convex polygons [J]. DISCRETE GEOMETRY, COMBINATORICS AND GRAPH THEORY, 2007, 4381 : 216 - +