Lecture 8: Meshes and Geometry Processing (23)

It looks like the halfedge data structure allows us to construct a graph of triangles along a mesh surface. A flood fill algorithm comes to my mind as a very useful graph algorithm to use on this data structure, but what are the uses of other graph traversal algorithms? Are there uses for a shortest path algorithm, and what could an edge length in the graph of half edges mean in the context of meshes?

You must be enrolled in the course to comment