Name
Abstract | ||
|---|---|---|
For k ≥ 3, let m(k, k + 1) be the smallest integer such that any set of m(k, k + 1) points in the plane, no three collinear, contains two different subsets Q1 and Q2, such that CH(Q1) is an empty convex k-gon, CH(Q2) is an empty convex (k + 1)-gon, and CH(Q1) ∩ CH(Q2) = 0, where CH stands for the convex hull. In this paper, we revisit the case of k = 3 and k = 4, and provide new proofs. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/978-3-540-70666-3_23 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Keywords | Field | DocType |
empty convex,convex hull,disjoint empty convex polygon,new proof,different subsets,empty convex k-gon | Orthogonal convex hull,Combinatorics,Disjoint sets,Convex body,Convex combination,Convex hull,Convex set,Convex polytope,Convex curve,Mathematics | Conference |
Volume | Issue | ISSN |
4381 LNCS | null | 16113349 |
Citations | PageRank | References |
3 | 0.44 | 4 |
Authors | ||
2 | ||