Hi, does anyone has a link to problems that, in order to solve it, we need to use the sweep line output sensitive algorithm to find all the intersections in a set of lines? I just learn it, but can't find a link to the problem.
Hi, does anyone has a link to problems that, in order to solve it, we need to use the sweep line output sensitive algorithm to find all the intersections in a set of lines? I just learn it, but can't find a link to the problem.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Name |
---|
This Tutorial is sufficient to understand this concept(atleast for me) with code.
I already understood the algorithm and even code it, what i need is a link to submit it
Problem Simple Polygon (also in gym) from CTU Open 2011 is one example, I think. You can also have a look here for other resources, and possibly more problems.