Name
Abstract | ||
|---|---|---|
Let P be a finite point set in general position in the plane. We consider empty convex subsets of P such that the union of the subsets constitute a simple polygon S whose dual graph is a path, and every point in P is on the boundary of S. Denote the minimum number of the subsets in the simple polygons S's formed by P by f\"p(P), and define the maximum value of f\"p(P) by F\"p(n) over all P with n points. We show that @?(4n-17)/15@?= |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.disc.2007.08.084 | Discrete Mathematics |
Keywords | Field | DocType |
the erdős–szekeres theorem,simple polygons,empty convex subsets,the erdős-szekeres theorem | Discrete mathematics,Polygon,Combinatorics,General position,Regular polygon,Planar,Dual graph,Point set,Simple polygon,Mathematics | Journal |
Volume | Issue | ISSN |
308 | 20 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kiyoshi Hosono | 1 | 60 | 11.01 |