Lecture 8: Mesh Representations and Geometry Processing (13)
keatonfs
This difference reminds me somewhat of how graphs can be represented as examined in CS170. You could use a large matrix that represents each potential edge, or use an adjacency list which is more complex, but saves memory and is easier to update/index.
jonathanlu31
Yea, I think there are also other mesh data structures that are even more similar to adjacency lists and matrices by representing the mesh as faces, vertices, and edges. They can then be related via adjacency matrix to encode how if an edge and vertex touch or if a face and vertex touch, etc. https://inst.eecs.berkeley.edu/~cs283/sp13/lectures/283-lecture4.pdf
This difference reminds me somewhat of how graphs can be represented as examined in CS170. You could use a large matrix that represents each potential edge, or use an adjacency list which is more complex, but saves memory and is easier to update/index.
Yea, I think there are also other mesh data structures that are even more similar to adjacency lists and matrices by representing the mesh as faces, vertices, and edges. They can then be related via adjacency matrix to encode how if an edge and vertex touch or if a face and vertex touch, etc. https://inst.eecs.berkeley.edu/~cs283/sp13/lectures/283-lecture4.pdf