Is this method the most efficient?
how does an edge have a distance from its surface if its on the surface?? Is the 'surface' the mesh itself or the plane that the mesh is sitting on
what is the complexity of this algorithm? O(E) since we are iterating over all edges?
I also have kbeache's question..isn't the distance from vertex to plane by definition 0 since the vertex is on the plane?
Is this method the most efficient?
how does an edge have a distance from its surface if its on the surface?? Is the 'surface' the mesh itself or the plane that the mesh is sitting on
what is the complexity of this algorithm? O(E) since we are iterating over all edges?
I also have kbeache's question..isn't the distance from vertex to plane by definition 0 since the vertex is on the plane?