The Community for Technology Leaders
Green Image
Issue No. 04 - July/August (2009 vol. 15)
ISSN: 1077-2626
pp: 558-571
Hong Qin , Stony Brook University, Stony Brook
Xin Li , Louisiana State University, Baton Rouge
Xianfeng Gu , Stony Brook University, Stony Brook
ABSTRACT
Surface mapping is fundamental to shape computing and various downstream applications. This paper develops a pants decomposition framework for computing maps between surfaces with arbitrary topologies. The framework first conducts pants decomposition on both surfaces to segment them into consistent sets of pants patches (a pants patch is intuitively defined as a genus-0 surface with three boundaries), then composes global mapping between two surfaces by using harmonic maps of corresponding patches. This framework has several key advantages over existing techniques. First, it is automatic. It can automatically construct mappings for surfaces with complicated topology, guaranteeing the one-to-one continuity. Second, it is general and powerful. It flexibly handles mapping computation between surfaces with different topologies. Third, it is flexible. Despite topology and geometry, it can also integrate semantics requirements from users. Through a simple and intuitive human-computer interaction mechanism, the user can flexibly control the mapping behavior by enforcing point/curve constraints. Compared with traditional user-guided, piecewise surface mapping techniques, our new method is less labor intensive, more intuitive, and requires no user's expertise in computing complicated surface maps between arbitrary shapes. We conduct various experiments to demonstrate its modeling potential and effectiveness.
INDEX TERMS
Mathematics of computing, computer graphics, computational geometry and object modeling, geometric algorithms, languages, and systems.
CITATION
Hong Qin, Xin Li, Xianfeng Gu, "Surface Mapping Using Consistent Pants Decomposition", IEEE Transactions on Visualization & Computer Graphics, vol. 15, no. , pp. 558-571, July/August 2009, doi:10.1109/TVCG.2008.200
128 ms
(Ver )