We need your help! 🔥
Please consider disabling your ad-blocker to support this website! 🔑
We are a free, community-supported website! 🥰
We only display small unobtrusive ads which help us stay online! 💯
Thank you in advance! ❤️
We are a free, community-supported website! 🥰
We only display small unobtrusive ads which help us stay online! 💯
Thank you in advance! ❤️
MD NearestNeighbors
Neighbourhood search of multi-dimensional points (euclidean kd-tree)
Inputs
| Name | ID | Description | Type |
|---|---|---|---|
| S | Set | Set to search from; each branch is a point, where the list items are the coordinates | Number |
| C | Cloud | Cloud to search in; each branch is a point, where the list items are the coordinates | Number |
| N | NN | Number of nearest neighbours to find | Integer |
Outputs
| Name | ID | Description | Type |
|---|---|---|---|
| Connectivity | C | Output Connectivity by indices | Integer |
Site design © Robin Rodricks.
Octopus and associated data © 2025 Robert Vierlinger.
Rhinoceros and Grasshopper are registered trademarks of Robert McNeel & Associates.
Hosted by GitHub