Subdivision Connectivity Remeshing And Subdivision Wavelets Applied Research

With modern computer technology and the development of three-dimensionalscanning technology, using triangular mesh as expression of the three-dimensionalgeometric model data is increasingly becoming mainstream of multimedia data. Withincreasingly huge scale of scanned grid data, storage and processing of the grid datahas attracted more and more attention. Wavelet is a kind of importantmulti-resolution technology.Combining wavelet transform and segments which isnamed subdivision wavelet methods has become a focus.Premise for applying wavelet normalizing the grid, that is reconstructing thearbitrary topology mesh into a grid having subdivision connectivity properties.MAPS method is by far the most classic algorithm for remeshing a grid withsubdivision connectivity. This thesis improves the point location algorithm in MAPS.First splitting bounding box of the base mesh along the axis sparsely to locate theinitial positioning edge coarsely,then construct a kd tree for each cube in which anode is corresponding with mapping of an original triangle mesh.The biorthogonal Loop subdivision wavelets proposed by Bertram doesn’t needto apply additional memory during construction, and doesn’t need to solve globallinear equations and has linear decomposition and synthesis time complexity. Thisthesis studies subdivision wavelet multiresolution analysis methodand realizing amulti-resolution system, which has a good result for transformation, compressionand denoising. It can be helpful in animation, games, and engineering applications.