Previous | Next --- Slide 36 of 41
Back to Lecture Thumbnails

Question: repeating the question on the slide above: Given the representation above, what is the cost of finding all the triangles touching a specified vertex in a mesh containing V vertices and T triangles? (What is your algorithm for doing so?)


@kayvonf Should it be 3T? Since we need to check all 3 vertices in all the triangles?