Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Topological evolution of surfaces
GI '96 Proceedings of the conference on Graphics interface '96
Parametrization and smooth approximation of surface triangulations
Computer Aided Geometric Design
Shape transformation using variational implicit functions
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Topology matching for fully automatic similarity estimation of 3D shapes
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Loops in reeb graphs of 2-manifolds
Proceedings of the nineteenth annual symposium on Computational geometry
Spherical parametrization and remeshing
ACM SIGGRAPH 2003 Papers
Globally smooth parameterizations with low distortion
ACM SIGGRAPH 2003 Papers
Fundamentals of spherical parameterization for 3D meshes
ACM SIGGRAPH 2003 Papers
Global conformal surface parameterization
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Removing excess topology from isosurfaces
ACM Transactions on Graphics (TOG)
Time-varying reeb graphs for continuous space-time data
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Fair morse functions for extracting the topological structure of a surface mesh
ACM SIGGRAPH 2004 Papers
Cross-parameterization and compatible remeshing of 3D models
ACM SIGGRAPH 2004 Papers
ACM SIGGRAPH 2004 Papers
Metamorphosis of 3D Polyhedral Models Using Progressive Connectivity Transformations
IEEE Transactions on Visualization and Computer Graphics
Local and Global Comparison of Continuous Functions
VIS '04 Proceedings of the conference on Visualization '04
Feature-based surface parameterization and texture mapping
ACM Transactions on Graphics (TOG)
Robust spherical parameterization of triangular meshes
Computing - Geometric modelling dagstuhl 2002
Computing surface hyperbolic structure and real projective structure
Proceedings of the 2006 ACM symposium on Solid and physical modeling
Generating genus-n-to-m mesh morphing using spherical parameterization: Research Articles
Computer Animation and Virtual Worlds - CASA 2006
Extreme Elevation on a 2-Manifold
Discrete & Computational Geometry
Unconstrained spherical parameterization
SIGGRAPH '05 ACM SIGGRAPH 2005 Sketches
Optimal pants decompositions and shortest homotopic cycles on an orientable surface
Journal of the ACM (JACM)
Topology Repair of Solid Models Using Skeletons
IEEE Transactions on Visualization and Computer Graphics
Geometric modeling in shape space
ACM SIGGRAPH 2007 papers
Genus Oblivious Cross Parameterization: Robust Topological Management of Inter-Surface Maps
PG '07 Proceedings of the 15th Pacific Conference on Computer Graphics and Applications
Surface matching using consistent pants decomposition
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Globally Optimal Surface Mapping for Surfaces with Arbitrary Topology
IEEE Transactions on Visualization and Computer Graphics
Discrete surface Ricci flow: theory and applications
Proceedings of the 12th IMA international conference on Mathematics of surfaces XII
Customizing 3D garments based on volumetric deformation
Computers in Industry
| Hi-index | 0.00 |
In this paper we present a robust approach to construct a map between two triangulated meshes, M and M^' of arbitrary and possibly unequal genus. We introduce a novel initial alignment scheme that allows the user to identify ''landmark tunnels'' and/or a ''constrained silhouette'' in addition to the standard landmark vertices. To describe the evolution of non-landmark tunnels we automatically derive a continuous deformation from M to M^' using a variational implicit approach. Overall, we achieve a cross parameterization scheme that is provably robust in the sense that it can map M to M^' without constraints on their relative genus. We provide a number of examples to demonstrate the practical effectiveness of our scheme between meshes of different genus and shape.