• Forum
  • Lounge
  • Computational Geometry - Sweep line algo

Computational Geometry - Sweep line algorithm

Hello guys. I'm approaching computational geometry, and i would like to implement sweep line algorithm.

I don't know how to implement the Sweep line data structure, namely i know that it is better it is a Balanced Tree but i don't know what to use in STL for a such structure.

I'm think the map data structure is useful, but i don't know how to handle the compare function when event point changes.

Is there something in STL i can use for this purpose? if not have i to implement on my self such structure without using external libraries?

Thank you.
Topic archived. No new replies allowed.