Lecture 8: Mesh Representations and Geometry Processing (23)
AlexSchedel
These show up in a datastructure called a "Doubly Connected Edge List" and are really cool because they allow you to do a lot of manipulation of planes in space and check for basic things like if those planes overlap or not really efficiently. If you were just use a standard DFS traversal or something like that to check if planes overlapped it would be very slow, but this datastructure will do it almost instantly even for a large collection of edges. I actually have a friend who built an app to do stage design for plays using this datastructure, so it has applications just outside of graphics too!
mojito-1
So we can trace all edge events to a vertex and across the grid, effectively performing loop subdivision
These show up in a datastructure called a "Doubly Connected Edge List" and are really cool because they allow you to do a lot of manipulation of planes in space and check for basic things like if those planes overlap or not really efficiently. If you were just use a standard DFS traversal or something like that to check if planes overlapped it would be very slow, but this datastructure will do it almost instantly even for a large collection of edges. I actually have a friend who built an app to do stage design for plays using this datastructure, so it has applications just outside of graphics too!
So we can trace all edge events to a vertex and across the grid, effectively performing loop subdivision