Timeline for Lower bound for Convex hull
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 29, 2012 at 21:08 | history | tweeted | twitter.com/#!/StackCompSci/status/263024610541441024 | ||
| Oct 29, 2012 at 18:56 | history | edited | Raphael | CC BY-SA 3.0 |
added 6 characters in body
|
| Oct 29, 2012 at 9:05 | history | edited | pnp | CC BY-SA 3.0 |
corrected word usage
|
| Oct 29, 2012 at 9:03 | history | edited | A.Schulz | CC BY-SA 3.0 |
typos and added tags
|
| Oct 29, 2012 at 8:39 | comment | added | Jernej | For your question see, en.wikipedia.org/wiki/… . A somehow surprising fact is that even if you choose some other model (like the quadratic decision model) the complexity is still bounded by $O(n\log{n})$ | |
| Oct 29, 2012 at 8:24 | answer | added | Nejc | timeline score: 6 | |
| Oct 29, 2012 at 7:20 | history | asked | pnp | CC BY-SA 3.0 |