Genus Oblivious Cross Parameterization: Robust Topological Management of Inter-Surface Maps

We consider the problem of generating a map between two triangulated meshes, M and M’, with arbitrary and possibly differing genus. This problem has rarely been tackled in its generality. Early schemes considered only topological spheres. Recent algorithms allow inputs with an arbitrary number of tunnels but require M and M’ to have equal genus, mapping tunnel to tunnel. Other schemes which allow more general inputs are not guaranteed to work and the authors do not provide a characterization of the input meshes that can be processed successfully. Moreover, the techniques have difficulty dealing with coarse meshes with many tunnels. In this paper we present the first robust approach to build a map between two meshes of arbitrary unequal genus. We also provide a simplified method for setting the initial alignment between M and M’, reducing reliance on landmarks and allowing the user to select “landmark tunnels” in addition to the standard landmark vertices. After computing ...

• Type: Conference
• Year: 2007
• Where: PG
• Authors: Janine Bennett, Valerio Pascucci, Kenneth I. Joy
• Keywords: Algorithms Allow Inputs, Arbitrary Unequal Genus, Computer Graphics, PG 2007, first Robust Approach