A Note on the Minimum Size of a Point Set Containing Three Nonintersecting Empty Convex Polygons

被引：0

作者：

Yang, Qing ^{[1
]}

You, Zengtai ^{[2
]}

You, Xinshang ^{[3
]}

机构：

[1] Shanxi Univ Finance & Econ, Fac Accounting, Taiyuan 030006, Shanxi, Peoples R China

[2] Dalian Minzu Univ, Coll Comp Sci & Engn, Dalian 116600, Peoples R China

[3] Shandong Univ Sci & Technol, Coll Econ & Management, Qingdao 266590, Peoples R China

来源：

SYMMETRY-BASEL | 2018年 / 10卷 / 10期

关键词：

planar point set; convex polygon; disjoint holes; PARTITION PROBLEM;

D O I：

10.3390/sym10100447

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

Let P be a planar point set with no three points collinear, k points of P be a k-hole of P if the k points are the vertices of a convex polygon without points of P. This article proves 13 is the smallest integer such that any planar points set containing at least 13 points with no three points collinear, contains a 3-hole, a 4-hole and a 5-hole which are pairwise disjoint.

引用

页数：17

共 29 条

[1] On the Minimum Size of a Point Set Containing Three Non-intersecting Empty Convex Polygons
Liu, Lingling
Zhang, Yuqin
[J]. ARS COMBINATORIA, 2019, 143 : 351 - 358
[2] On the minimum size of a point set containing two non-intersecting empty convex polygons
Hosono, K
Urabe, M
[J]. DISCRETE AND COMPUTATIONAL GEOMETRY, 2005, 3742 : 117 - 122
[3] On empty convex polygons in a planar point set
Pinchasi, R
Radoicic, R
Sharir, M
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 2006, 113 (03) : 385 - 419
[4] Partitioning a planar point set into empty convex polygons
Ding, R
Hosono, K
Urabe, M
Xu, CQ
[J]. DISCRETE AND COMPUTATIONAL GEOMETRY, 2002, 2866 : 129 - 134
[5] ON THE MINIMUM CARDINALITY OF A PLANAR POINT SET CONTAINING TWO DISJOINT CONVEX POLYGONS
Wu, Liping
Lu, Wanbing
[J]. STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 2013, 50 (03) : 331 - 354
[6] Faster counting empty convex polygons in a planar point set
Bae, Sang Won
[J]. INFORMATION PROCESSING LETTERS, 2022, 175
[7] ON SOME LARGEST EMPTY ORTHOCONVEX POLYGONS IN A POINT SET
DATTA, A
RAMKUMAR, GDS
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 472 : 270 - 285
[8] A NOTE ON BOUNDS ON THE MINIMUM AREA OF CONVEX LATTICE POLYGONS
COLBOURN, CJ
SIMPSON, RJ
[J]. BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 1992, 45 (02) : 237 - 240
[9] Planar point sets with a small number of empty convex polygons
Bárány, I
Valtr, P
[J]. STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 2004, 41 (02) : 243 - 266
[10] Minimum convex partition of a constrained point set
Fevens, T
Meijer, H
Rappaport, D
[J]. DISCRETE APPLIED MATHEMATICS, 2001, 109 (1-2) : 95 - 107

← 1 2 3 →