Comment on page

3.9.3: Closest Points Multi-dimensional

Fig. 3.9.3.1: Random points in a unit volume connected to their nearest neighbor in a 5-D setting
A nearest neighbor search can be generalized to any number of dimensions. Use the “Closest Point Multi-Dimensional”-component in case of more than three. Fig. 3.9.3.1 shows an example with five dimensions: Dimensions one to three represent space. Dimension four is the shortest distance between each point and the thick red guide line. The curve parameter of the guide line at the point where it meets the line of shortest distance acts as fifth dimension. Each of the randomly generated points is connected with its nearest neighbor. One can see from fig. 3.9.3.1 that the resulting line segments align to the guide curve – in some way.
There are three input-plugs on the component:
​
​
"P"
Expects a data tree, where each branch contains n values which are the coordinates of the points. The “P”-input specifies points where nearest neighbor connections can start.
"C"
Expects the same sort of input as “P”. It contains the points where nearest neighbor connections can end.
"N"
number of nearest neighbor connections to be generated for each point in “P”. The output “i” of the “Multi-dimensional Nearest Neighbors”-component is a connectivity diagram.
​
Nearest_Neighbors_MultiDimensional.gh
23KB
Binary

3.9.2: Closest Points

3.9.4: Cull Curves

Last modified 2yr ago


"P"	Expects a data tree, where each branch contains n values which are the coordinates of the points. The “P”-input specifies points where nearest neighbor connections can start.
"C"	Expects the same sort of input as “P”. It contains the points where nearest neighbor connections can end.
"N"	number of nearest neighbor connections to be generated for each point in “P”. The output “i” of the “Multi-dimensional Nearest Neighbors”-component is a connectivity diagram.