Intersection points are extracted from the input curve network. The intersection coordinates “t” within the domain of each curve are then used to shattered them at the intersection, generating a series of curve segments. The same straightening process is then applied as for the single curve: each resulting segment is converted to a polyline and then discretised. The simulation then attempts to re-arrange each segment with an angle as close to 0 degrees as possible between each consecutive segment.