computation of distance to nearest neighbor for each shape
This measure allows to compute the distance to the nearest neighbor for each shape. It is based on a geometric analysis of the shape neighborhood.
Meshes associated to shapes are currently extremely dense. In consequence the distance from a shape triangle to another shape is defined as minimum distance between its barycenter and the barycenters of the triangles of the other shape.
The parameter flag ProcessHoles allows to specify whether shape holes should be taken into account during the computation. Please see Distance to nearest neighbor 2d for an explanation of the effects of this flag.
Here is an example of the nearest neighbor computation for a single shape :
In the previous figure, the distance to the nearest neighbor is represented by a pink cone for the blue shape to the nearest shape belonging to its neighborhood.
Here is an example of the nearest neighbor computation for a sample of shapes :
In the previous figure, distance to the nearest neighbor is illustrated using a color map starting from green colors for lower distance and ending on red color for higher distances.
computation of distance to nearest neighbor for each shape
Measure Type | Measure Unit Type | Parameter Type | Result Type | Shape Requirements |
---|---|---|---|---|
![]()
Geometry 3d | ![]()
Length | ![]() | ![]()
Value (ipsdk::ipReal64) | ![]()
Boundary Approximation |
Generic example in 3d case :
IPSDKIPLShapeAnalysis