As long as you have a (spatially) ordered list of curves that do not intersect each other and that all intersect the surface it’s fairly easy.
Here’s how you could process the surface recursively with a Python node. I’ll add this to the next version of Clockwork - unless someone comes up with a more elegant solution, that is. 
