> faces/triangles in GTS are made from edges, so, an extra "layer".  agree re bug
> hunt, running your points through both implementations should provide useful
> info.
>

I found and fixed the kd-tree bug. So now it is correctly returning the nearest
vertex to the test point.

So my algorithm tests all triangles that use the nearest vertex, and then
calculates the minimum distance to each triangle, keeping the smallest of those.

It seems that this part is now not returning quite the correct minimum distance,
so I have to focus on that part next.

Post a reply to this message