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 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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 |
---|
Check if there i s a conv ex quadrilateral from a given set of points