It's about the Mesh Processing Library.

I have a problem finding the closest neighbors of a point.

The function getLinked( int index ) takes an index and returns those indexes which are linked to it in the Delaunay diagram. From there I can easily find which of those neighbors is the closest.

 

The problem I have is that sometimes the point itself is listed among it's neighbors.

In that case, a point linked to 2 others will have getLinked() return an array of length 3, which gives a minimum distance of 0, since the point itself is among it's neighbors.

 

Has anyone else noticed that? Seems to be a bug.