A novel texture mapping algorithm for planar meshes

Presently automatic texture mapping is a hot topic in computer graphics filed. Most previous automatic texture mapping algorithms have suffered from been too slow or could only use a limit set of feature points of the model. We introduce in this paper a new constrained-based method for automatic texture mapping that deal with these problems for planar meshes. Our critical improvements include generalizing feature point to feature curve to fit some application (eg. river, road modeling, etc.) and also simplified computation through efficient weighted of texture mapping. We generalize by parameterizing each vertex at two passes. Firstly we compute all the possible mapping along the feature curve consecutively where every triangle that consists of the computed vertex and two points in the curve can be deduced a conformal mapping result with minimum deformations. Then we combine all the possible mapping using normalization distribution to get the final one. Our results show that this texture mapping algorithm makes a great mapping for the planar meshes.