You are viewing the course site for a past offering of this course. The current offering may be found here.
Lecture 8: Mesh Representations and Geometry Processing (35)
DavidWLin

Looking at the middle and rightmost figures, I was reminded of the Spheres in Seattle. In a similar way, polygons are used to make up an overall spherical structure, and I wanted to know if/how algorithms (such as Loop Subdivision, and others involved in computer graphics) that are used to generate these figures can be applicable in interdisciplinary fields or other forms of engineering, like civil engineering or architectural design.

ashvindhawan

I'm curious if the simplification and subdivision algorithms we've discussed in this lecture are invertible/deterministic. For example, if we simplify a mesh, can we always deterministically recover the more complex version? Is this true for subdivision as well? Curious to hear other people's thoughts

StephenYangjz

I am wondering how do we predict the outcome of loop subdivision? For example, can we predict what will be added and what is lost while we do loop subdivisions? Or, is the algorithm nondeterministic? If so then, when do we know that we necessarily need this algorithm?

You must be enrolled in the course to comment