1. Bending Curves

DESCRIPTION:
The script uses U and V curves generated from an input surface as input for the previous “curve network” exercise. Each UV curve attempts to straighten itself out.

PROCEDURE:
UV curves are extracted from the input surface and then split into segments at their intersection points. Each resulting segment is then converted into a polyline and discretised. The simulation takes these discretised curves as input and outputs a surface in which each curve is as straight as possible.

DESCRIPTION: 
Instead of inputting a single curve, this script takes a network of curves and simulates what would happen if all curves would aim to straighten out while keeping their intersection points fixed.

PROCEDURE:
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.

The purpose of this exercise is to demonstrate the bending simulation of a single curve, using the “Rod” goal-angle component within Kangaroo 2. The set goal is to achieve 0 degrees bending angles between the discretised segments of an input curve.

PROCEDURE:
The input curve is converted to a polyline and shattered into segments (discretised). The original angle between each segment is then measured. The goal for the Kangaroo simulation is to then re-arrange the position of each segment in the most suitable way for achieving the closest value possible to 0 degrees between its input segments. The simulation output curve is the best estimation of a bent curve.