After running into the need to split up a big messy set of curves at all their intersection locations, I decided to make a python component.

Basically, if you input a bunch of curves, this component should find every place where they intersect and then split them up, return a list of curve pieces on a separate branch for each input curve.

It should be able to handle self intersections and overlaps.

Feel free to use it, edit the code, and let me know if you find any bugs.

Here's the code for the python component: https://gist.github.com/3031095

And here is the definition: SplitCurves.gh

Enjoy