-
-
Notifications
You must be signed in to change notification settings - Fork 107
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
the principle of distance calculation of point cloud to mesh #38
Comments
There are two parts to this. The first uses an AABB tree to find the nearest point on a mesh for each query point (find the closest triangle and then which position on that triangle is the closest point). The result of this step is an unsigned distance for each point on the mesh. To sign the distance (determine if it's inside or outside), the algorithm uses fast winding numbers which is described in the linked paper. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
I can't understand your algorithm that how to use the fast winding number to calculate the distance from the point cloud to the mesh, (I am not very familiar with the C++ , I can only understand the calculation process of calculating the winding number in Gavin's paper)
can you briefly describe the principle of distance calculation or recommand some paper to explain it.Thank you
The text was updated successfully, but these errors were encountered: