Lecture 8: Meshes and Geometry Processing (41)

Why do we split edges in a random order? It seems like it would be relatively simple to split into the order in the bottom right image (e.g. all new edges are only between new vertices).


I don't know if it is that easy to go directly from the top left to the bottom right just using split operations (at least I keep running into a problem). Maybe there is an algorithm that only splits but for the purposes of this class and the project loop subdivision does the job?


@loadberg One reason to use a random order is to allow for parallelization in a GPU. If the algorithm required a specific order, it implies a serial process.


After flipping, all new edges (aside from ones that overlap with old edges) will connect two new vertices. Is this a property for all subdivisions?

You must be enrolled in the course to comment