Talk:Kirkpatrick–Seidel algorithm
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Should someone (me?) add a section about the 2017 Journal of the ACM article from Afshani et al. showing that a very minor variant of Kirkpatrick and Seidel's algorithm is Instance Optimal among all algorithms ignoring the order of the input, hence kind of proving that this is the "ultimate convex hull algorithm"? (I am a co-author of the article in question.) — Preceding unsigned comment added by Lejyby (talk • contribs) 20:40, 14 February 2020 (UTC)