0
$\begingroup$

I have some code that creates a 3D mesh. The way I process the mesh I end up with a lot of vertices that are extremely close to each other but not identical. I want to create a hash from those vertices I can put in a dictionary to quickly look up if a vertex is in the dictionary before adding it or getting its index.

But the important thing is I need Vector3(0.001, 0, 0) and Vector3(0, 0, 0) to produce the same hash. And I need the function to be fast.

Is there a hash function that will let me do this?

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.