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 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
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.
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.