Lecture 8: Mesh Representations and Geometry Processing (22)
cchendyc
is this the same as the tri-neighbor example where ccw and cw are in a reversed order?
thecatherinehuang
This half-edge data structure is a pain to work with (tedious to assign all the items in the halfedge datastructure) but it's amazing that you can retrieve all the edges incident to a vertex and traverse the mesh, perform loop subdivision efficiently.
is this the same as the tri-neighbor example where ccw and cw are in a reversed order?
This half-edge data structure is a pain to work with (tedious to assign all the items in the halfedge datastructure) but it's amazing that you can retrieve all the edges incident to a vertex and traverse the mesh, perform loop subdivision efficiently.