Surface Flattening using Discrete Harmonic Map, Morphing, and Texture Mapping.
1. Solve discrete harmonic mapping of a given surface patch (suppose the surface is genus-0 and with one boundary)
1.1. Map the boundary loop onto a unit rectangle using chord-length parameterization:
a) Pick a random starting point B0, trace the boundary loop L, compute its total length |L|;
b) Starting from B0, find vertices B1, B2, B3 on L, such that the lengths of the boundary paths from B0 to B1, B2, and B3 , are (or just passed) |L|/4, |L|/2, and 3|L|/4, respectively;
c) Map B0, B1, B2, and B3, to (0,0), (1,0), (1,1), and (0,1) respectively, map curve segments (B0, B1), (B1, B2), (B2, B3), (B3, B0) to four boundaries of the unit square accordingly using chord-length parameterization. This fixes the boundary mapping: all boundary vertices are mapped.
1.2. For every interior vertex, map it to the weighted average center of its one-rings. The weight is the harmonic weight, i.e., the cotangent weight defined on the original mesh.
Initially, map all interior vertices to (0.5,0.5), then use one of the following two ways to find the solution:
A easier but slower way:
Iteratively move the mapping position of each vertex:
U_{i}^{k+1 }= (U_{i}^{k}+(Σ_{j≡n(i)} w_{ij} u_{j}^{k }/Σ_{j≡n(i)} w_{ij} )/2,
Here u denotes the coordinates on the plane, and we use k and k+1 to indicate the position before and after the (k+1)-th iteration.
You may need to do a few thousand iterations until you see the movement is small.
A faster way:
Assemble the coefficient matrix and solve the linear system (check slides)
2. Use your keyboard to control a linear interpolation between the original mesh and its planar target shape
a. Each vertex vi has its original 3D coordinates pi and 2D coordinates ui, its current position is x_{i} = (1-t) p_{i}+t u_{i}
b. Use “-“ and “+” to decrease/increase the value of t, which should be restricted to [0,1]
3. Do a texture mapping using your computed coordinates.