Does an efficient implementation to extract edges from a mesh of triangles without duplicates?
- Vertices are a list of 3D points
- Triangles are a list of 3 indices pointing to vertices above
We want to find very quickly:
- A list of 2 indices representing the triangle sides but without duplicates (of course, you always get two with opposite direction)