NeighborsCalculator

Calculate neighbors for your point clouds with strict region isolation. Upload CSV files to generate neighbor lists and visualize the results.

Region Aware
Global Indexing
CSV Export

Mathematical Foundations

Understanding the topological requirements for the mGFD method

The meshless Generalized Finite Difference (mGFD) method relies on a Taylor polynomial expansion to approximate derivatives over a cloud of points.

To ensure that the resulting system of equations is algebraically determined and well-conditioned, it is crucial to select a sufficient number of nearest neighbors, denoted as \( n \), based on the chosen polynomial degree \( m \).

Minimum recommended neighbors:

\[ n \ge \frac{(m+1)(m+2)}{2} \]

For \( m = 2 \)

A second-degree polynomial requires at least \( n = 6 \) neighbors.

For \( m = 3 \)

A third-degree polynomial requires at least \( n = 10 \) neighbors.

Upload Point Cloud

Select a CSV file with x, y, classification, region columns

Neighborhood Settings

Specify the exact number of nearest neighbors to connect for each node.

\( n = \)

Drop your CSV file here

or click to browse files

CSV
Maximum file size: 10MB
Browse Files