Introduction to algorithms
Multiresolution analysis of arbitrary meshes
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Multiresolution analysis for surfaces of arbitrary topological type
Multiresolution analysis for surfaces of arbitrary topological type
Multiresolution analysis for surfaces of arbitrary topological type
ACM Transactions on Graphics (TOG)
Parametrization and smooth approximation of surface triangulations
Computer Aided Geometric Design
MAPS: multiresolution adaptive parameterization of surfaces
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Graphical Models and Image Processing
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Progressive geometry compression
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Consistent mesh parameterizations
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Texture mapping progressive meshes
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Metamorphosis of Arbitrary Triangular Meshes
IEEE Computer Graphics and Applications
Feature-based Surface Decomposition for Correspondence and Morphing Between Polyhedra
CA '98 Proceedings of the Computer Animation
Multiresolution Interpolation Meshes
PG '01 Proceedings of the 9th Pacific Conference on Computer Graphics and Applications
Cross-parameterization and compatible remeshing of 3D models
ACM SIGGRAPH 2004 Papers
3D Triangular Mesh Parameterization with Semantic Features Based on Competitive Learning Methods
IEICE - Transactions on Information and Systems
Hi-index | 0.00 |
The vertex correspondence establishment among multiple objects is a versatile operation in computer graphics and geometry processing. We propose a systematic method called recursive quinary subdivision to efficiently find a dissection for a meshed object of genus-zero with little user input. The process can be easily extended to multiple objects, taking into account the alignment of extra feature points for applications such as mesh metamorphosis, to derive a common dissection. Based on the dissection and the parameterization associated with each resulting patch, uniform or adaptive remeshing can be performed to yield a set of semi-regular meshes. Moveover, geometric details can be easily resampled and stored as normal maps. We demonstrate the mesh metamorphosis application between two or more objects based on the vertex correspondence established by the common dissection and parameterization.