Name
Abstract | ||
|---|---|---|
We show that the Minkowski sum of a simple polygon with n edges and a segment has at most 2n - 1 edges, and that this bound is tight in the worst case. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0020-0190(02)00403-9 | Inf. Process. Lett. |
Keywords | Field | DocType |
worst case,n edge,minkowski sum,simple polygon,computational geometry | Discrete mathematics,Rectilinear polygon,Combinatorics,Polygon,Midpoint polygon,Polygon covering,Pick's theorem,Simple polygon,Affine-regular polygon,Equilateral polygon,Mathematics | Journal |
Volume | Issue | ISSN |
85 | 4 | 0020-0190 |
Citations | PageRank | References |
1 | 0.39 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gennady Pustylnik | 1 | 2 | 0.75 |
| Micha Sharir | 2 | 8405 | 1183.84 |