Understanding how KNearestSearch works

xiaoming
Thu, 07 Mar 2024 13:35:25 +0000
New to Julia

I have a surface in three-dimensional space composed of triangles generated by Meshes.jl. Given a point in space, the function ‘search’ in Meshes.jl can find the closest triangle to this point. I want to know how this distance is measured, how the algorithm is implemented, and it would be even better if someone could provide some reference materials.

6 posts - 3 participants