Jump to content

Talk:Kirkpatrick–Seidel algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by SineBot (talk | contribs) at 20:41, 14 February 2020 (Signing comment by Lejyby - "proposed new section."). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Start‑class Low‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StartThis article has been rated as Start-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-priority on the project's priority scale.

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 (talkcontribs) 20:40, 14 February 2020 (UTC)[reply]