|This talk is dedicated to the analysis of data sets that are defined on irregular triangular meshes. Our aim is to compute successive simplifications of the original mesh, and to compute the corresponding successive lower resolution approximations of the original data on the new simplified meshes. Moreover, we want to be able to exactly reconstruct the original data from the current approximation and from a set of so-called detail coefficients. Since we are dealing with irregular triangular meshes, we cannot apply triangular multiresolution analysis schemes. We will present a generalization of these schemes that is applicable to irregular triangular meshes.|
Return to George-Pierre Bonneau's homepage.