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! ❤️


Geometry


Maths

NAN

Networks

Primitive


Streaming


Uncertainty


Utilities

Vectors

Proximity Inter-Network

Create an Inter-Network between adjacent points from multiple sets

Inputs

Name	ID	Description	Type
Points	P	Point-Tree to create an Inter-Network from	Point
Distance	d	The searching distance to find connection	Domain
Number	n	The maximum number of the junction from each node	Integer

Outputs

Name	ID	Description	Type
Node → [Node]	N→[N]	This is the topology of nodes from one network connected to nodes from other networks. Each Node's definition would rely on an 'InterNode' param in this case(inseated of integer-param as a node). Each Path address in the data tree describes the network index and the indicated Node index as the following description: {...;;}	HyperIndex
Edge → [Node]	E→[N]	This topology format indicates which two nodes define one Edge through multiple networks. In this case, nodes are represented by one Inter-Node, which means both the network's index and the node's index within the network. Each path address in this data tree describes an edge (connection) between two inter-nodes in the same or different networks.	HyperIndex
Points	P	Flatten Points	Point
Lines	L	Network lines	Line

Proximity Inter-Network

Create an Inter-Network between adjacent points from multiple sets

Inputs

Outputs

Video Tutorials