search

taiya / dgp

Digital Geometry Processing - Fall 2016 - University of Victoria
38 stars 11 forks source link

Multiscale deformation algorithm in real-time #31

Closed alinachin closed 7 years ago

alinachin commented 7 years ago

Would it be a reasonable approach to keep the base (smoothed) mesh in memory and apply the deformation & high-frequency details every step? Essentially, separating the low and high frequencies only during the initialization, not for every frame.

I've been reading the textbook and the slides and they present the multiscale deformation process as one deformation, whereas the assignment is to make an interactive app, so a series of deformations. I looked for similar papers and implementations but didn't have any luck apart from [Zorin 1997], which seems similar to what I'm suggesting, but I'm not confident yet.

taiya commented 7 years ago

It's not the smoothed mesh that remains in memory, it's the sparse factorized laplacian matrices that are! If I recall correctly, you missed the lecture when we covered a pre-factorized deformation algorithm -- ask your colleagues as that exercise's solution is not public (as it is part of Hw3).

alinachin commented 7 years ago

No, I caught up on the MATLAB exercise earlier; my question was me overthinking this process:

multiresolution

So what you're saying is the decomposition, editing, and reconstruction are performed each time we need to deform the mesh?

taiya commented 7 years ago

The decomposition and the factorization of B (so that the low frequency is edited efficiently Is done in pre-processing. The solve through back-substitution and the reconstruction of details is done per-frame

alinachin commented 7 years ago

Thank you, that clears things up!