Editable polycube map for GPU-based subdivision surfaces
I3D '11 Symposium on Interactive 3D Graphics and Games
Computer-Aided Design
Expert Systems with Applications: An International Journal
Functional maps: a flexible representation of maps between shapes
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
SMI 2012: Full Posture-invariant statistical shape analysis using Laplace operator
Computers and Graphics
Constructing common base domain by cues from Voronoi diagram
Graphical Models
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Iterative cage-based registration from multi-view silhouettes
Proceedings of the 10th European Conference on Visual Media Production
Fitting polynomial volumes to surface meshes with Voronoï squared distance minimization
SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing
Hi-index | 0.01 |
We introduce a template fitting method for 3D surface meshes. A given template mesh is deformed to closely approximate the input 3D geometry. The connectivity of the deformed template model is automatically adjusted to facilitate the geometric fitting and to ascertain high quality of the mesh elements. The template fitting process utilizes a specially tailored Laplacian processing framework, where in the first, coarse fitting stage we approximate the input geometry with a linearized biharmonic surface (a variant of LS-mesh [CHECK END OF SENTENCE]), and then the fine geometric detail is fitted further using iterative Laplacian editing with reliable correspondence constraints and a local surface flattening mechanism to avoid foldovers. The latter step is performed in the dual mesh domain, which is shown to encourage near-equilateral mesh elements and significantly reduces the occurrence of triangle foldovers, a well-known problem in mesh fitting. To experimentally evaluate our approach, we compare our method with relevant state-of-the-art techniques and confirm significant improvements of results. In addition, we demonstrate the usefulness of our approach to the application of consistent surface parameterization (also known as cross-parameterization).