You are given a set of points with their integer coordinates. You need to determine if there are convex quarilaterals in at most O(n^2) time.
For example: 5 2 2 5 3 8 2 7 6 4 7 Has
5 2 2 7 6 7 4 9 4 10 4 Has not
Thank you for your help!
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
Check if there is a convex quadrilateral from a given set of points
You are given a set of points with their integer coordinates. You need to determine if there are convex quarilaterals in at most O(n^2) time.
For example: 5 2 2 5 3 8 2 7 6 4 7 Has
5 2 2 7 6 7 4 9 4 10 4 Has not
Thank you for your help!
Name |
---|