The Network Deform grasshopper definition enables the user to deform curves based on attractor points. The definition requires two inputs: 1. Attractor Points and 2. Curves. The imported curves are divided into a number of points determined by the Curve Length Division Factor parameter. Each imported curve has a length, which is then multiplied by a value between 0 and 1. The resulting product becomes the number of divisions for each curve. Each division point is then assigned to its closest attractor point. This vector is amplified by the “Deformation Amplitude” parameter. This value determines how far to move the point towards its attractor. The user has the ability to reverse the direction of the deformation.

The definition comes with a secondary set of parameters which yield more provocative results. Once the curves have been divided into points, and each point is assigned to an attractor, we can then decide if we want to “lock” or maintain the original position of the closest or farthest division points. Once we decide which region of curves to lock, we need to specify how many, using the “Closest Points to Remove” number slider. Since this value is global, and not local, if we were to say “remove 100 points from the deformation”, but one curve has only 90 division points, that curve will be removed from the output. The “Closest Points to Keep” number slider determines how many points to keep in the event that the number of removal points is greater than the number of division points.

**Download
Network Deform Reference Posts: My Closest Closest Points, My Closest Points**

## Share your thoughts