Abstract
This paper introduces an algorithm for computing low-distortion, bijective mappings between surface meshes. The algorithm re-cieves as input a coarse set of corresponding pairs of points on the two surfaces, and follows three steps: (i) cutting the two meshes to disks in a consistent manner; (ii) jointly flattening the two disks via a novel formulation for minimizing isometric distortion while guaranteeing local injectivity (the flattenings can overlap, however); and (iii) computing a unique continuous bijection that is consistent with the flattenings. The construction of the algorithm stems from two novel observations: first, bijections between disk-type surfaces can be uniquely and efficiently represented via consistent locally injective flatten-ings that are allowed to be globally overlapping. This observation reduces the problem of computing bijective surface mappings to the task of computing locally injective flattenings, which is shown to be easier. Second, locally injective flattenings that minimize isometric distortion can be efficiently characterized and optimized in a convex framework. Experiments that map a wide baseline of pairs of surface meshes using the algorithm are provided. They demonstrate the ability of the algorithm to produce high-quality continuous bijective mappings between pairs of surfaces of varying isometric distortion levels.
Original language | English |
---|---|
Article number | 69 |
Journal | ACM Transactions on Graphics |
Volume | 33 |
Issue number | 4 |
DOIs | |
State | Published - 2014 |
Externally published | Yes |
Event | 41st International Conference and Exhibition on Computer Graphics and Interactive Techniques, ACM SIGGRAPH 2014 - Vancouver, BC, Canada Duration: 10 Aug 2014 → 14 Aug 2014 |
Keywords
- Bijective simpli-cial mappings
- Isometeric distortion
- Surface mesh
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design