Surface Mapping using Consistent Pants Decomposition Export

@article{citeulike:3893616, 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-zero 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.}, address = {Los Alamitos, CA, USA}, author = {Li, Xin and Gu, Xianfeng and Qin, Hong}, citeulike-article-id = {3893616}, citeulike-linkout-0 = {http://doi.ieeecomputersociety.org/10.1109/TVCG.2008.200}, citeulike-linkout-1 = {http://dx.doi.org/10.1109/TVCG.2008.200}, doi = {10.1109/TVCG.2008.200}, issn = {1077-2626}, journal = {IEEE Transactions on Visualization and Computer Graphics}, keywords = {3d, decomposition, mapping, segmentation, surface}, number = {1}, posted-at = {2009-01-17 10:11:37}, priority = {2}, publisher = {IEEE Computer Society}, title = {Surface Mapping using Consistent Pants Decomposition}, url = {http://dx.doi.org/10.1109/TVCG.2008.200}, volume = {99}, year = {5555} }

TY - JOUR ID - citeulike:3893616 L3 - citeulike-article-id:3893616 N2 - 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-zero 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. IS - 1 JF - IEEE Transactions on Visualization and Computer Graphics SN - 1077-2626 AD - Los Alamitos, CA, USA TI - Surface Mapping using Consistent Pants Decomposition PB - IEEE Computer Society VL - 99 KW - 3d KW - decomposition KW - mapping KW - segmentation KW - surface AU - Li, Xin AU - Gu, Xianfeng AU - Qin, Hong PY - 5555/// UR - http://dx.doi.org/10.1109/TVCG.2008.200 ER -