Ernestico's blog

By Ernestico, history, 6 years ago, In English

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.

 
 
 
 
  • Vote: I like it
  • +10
  • Vote: I do not like it

»
6 years ago, # |
  Vote: I like it 0 Vote: I do not like it

This Tutorial is sufficient to understand this concept(atleast for me) with code.

  • »
    »
    6 years ago, # ^ |
      Vote: I like it +15 Vote: I do not like it

    I already understood the algorithm and even code it, what i need is a link to submit it

»
6 years ago, # |
Rev. 2   Vote: I like it +10 Vote: I do not like 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.