Name
Abstract | ||
|---|---|---|
In this note we show by example that the algorithm presented in 1979 by Dobkin and Snyder for finding the largest-area k-gon that is inscribed in a convex polygon fails to find the optimal solution for k=4. This question, posed by Keikha et al. who show that the presented method fails to find the optimal solution for k=3. |
Year | Venue | Field |
|---|---|---|
2017 | arXiv: Computational Geometry | Discrete mathematics,Combinatorics,Polygon covering,Inscribed figure,Convex polygon,Krein–Milman theorem,Convex set,Quadrilateral,Star-shaped polygon,Affine-regular polygon,Mathematics |
DocType | Volume | Citations |
Journal | abs/1708.00681 | 0 |
PageRank | References | Authors |
0.34 | 2 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vahideh Keikha | 1 | 1 | 2.85 |
| Maarten Löffler | 2 | 551 | 62.87 |
| Ali Mohades | 3 | 140 | 26.04 |
| Ivor van der Hoog | 4 | 1 | 2.51 |