Issue No. 10 - Oct. (2012 vol. 18)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2011.115
Charlie C.L. Wang , The Chinese University of Hong Kong, Hong Kong
Tsz-Ho Kwok , The Chinese University of Hong Kong, Hong Kong
Yunbo Zhang , The Chinese University of Hong Kong, Hong Kong
Given a set of corresponding user-specified anchor points on a pair of models having similar features and topologies, the cross parameterization technique can establish a bijective mapping constrained by the anchor points. In this paper, we present an efficient algorithm to optimize the complexes and the shape of common base domains in cross parameterization for reducing the distortion of the bijective mapping. The optimization is also constrained by the anchor points. We investigate a new signature, Length-Preserved Base Domain (LPBD), for measuring the level of stretch between surface patches in cross parameterization. This new signature well balances the accuracy of measurement and the computational speed. Based on LPBD, a set of metrics are studied and compared. The best ones are employed in our domain optimization algorithm that consists of two major operators, boundary swapping and patch merging. Experimental results show that our optimization algorithm can reduce the distortion in cross parameterization efficiently.
Shape analysis, Optimization, Layout, Computational modeling, Topology, surface parameterization., Complex domain, optimization, stretch, cross parameterization
Charlie C.L. Wang, Tsz-Ho Kwok, Yunbo Zhang, "Efficient Optimization of Common Base Domains for Cross Parameterization", IEEE Transactions on Visualization & Computer Graphics, vol. 18, no. , pp. 1678-1692, Oct. 2012, doi:10.1109/TVCG.2011.115