Timeline for The use of binary search when determining whether a point lies inside a given convex hull
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 19, 2017 at 17:43 | vote | accept | Bruno Vandekerkhove | ||
| Aug 19, 2017 at 17:41 | comment | added | Bruno Vandekerkhove | Thanks, it seems somewhat trivial in the end. I got confused because of an alternative algorithm that first determines the vertices with maximum and minimum y-coordinate, which apparently requires a variation of binary search explained here (instead of taking the middle, the point at index 1/3 and that at index 2/3 are used). | |
| Aug 19, 2017 at 17:01 | history | edited | Gregor Michalicek | CC BY-SA 3.0 | added 1 character in body |
| Aug 19, 2017 at 16:45 | review | First posts | |||
| Aug 19, 2017 at 19:02 | |||||
| Aug 19, 2017 at 16:43 | history | answered | Gregor Michalicek | CC BY-SA 3.0 |