1.2. Basic Components

DESCRIPTION 

Sometimes data is stored in a predictable (sorted) fashion, sometimes it is chaotic (unsorted). The Sort component allows you to sort multiple sets of data simultaneously, though this example only sorts 2 sets at the same time. Points by themselves cannot be sorted, but numbers can. This example sorts an unsorted set of points by creating a new list of distance values which acts as the key list. As the key list is sorted, the points are automatically shuffled in the same fashion.  

PROCEDURE 

1.Create a point grid of parametrically defined size and density  
2.Generate a circle around it and pick a point on this circle using a slider (reparameterise the curve first so evaluated point-coordinates fall between values 0 and 1)  
3.Calculate the distance from this point to each point of the grid  
4.Sort the point list (a) acc. To the key list (k), which is the distance of each point to the evaluated circle point  
5.Draw a polyline through the sorted point list and join it with a line that connects the evaluated circle point with the closest grid-point i.e., the first one in the list 

DESCRIPTION

There are several ways available to get at individual elements in a list or to extract subsets of data. One of the easiest methods is to use a Split component. This component breaks a list of data into two sublists at the specified index.

PROCEDURE

1.Create a grid of points using cross-reference
2.Split the list into two using a slider
3.Create boxes with varying properties using: surface > primitive > centre box

DESCRIPTION

When accessing individual items in a list, one must use an index value. The first item in any list is always stored at location zero, the second item at location 1 and so on and so forth. Typically, if you start to access a list at index -5, an error will occur since no such location exists. However, some components that deal with indices have a Cycle option that remaps any index values onto the valid domain.

PROCEDURE

1.Create a series of numbers from 0 to 10, with an increment of 1
2.Draw points with as x-coordinate the numbers from the series
3.Select an item from this list using a slider
4.1 = switch cycle on; 0 = switch cycle off
5.Tag the itemized point

DESCRIPTION
 
Essentially Data Matching algorithms kick in when inputs don’t match up. If you connect a line component (two inputs, starting and ending points) to two lists of point coordinates that have a different number of points, it is not clear which points are supposed to be connected. You can pick among three different matching algorithms to find the one that suits you best. Data Matching algorithms can be set on a per-component basis through the menu of the component.

PROCEDURE

1. Set curves to 1 curve in Rhino
2. Divide curve according to a slider
3. Connect points from different curves by using buttons “shortest list / longest list / cross reference” from component panel “set > List” before connecting to the “line” button
4. Change sliders to see impact