TY - JOUR
T1 - Meshless harmonic volumetric mapping using fundamental solution methods
AU - Li, Xin
AU - Guo, Xiaohu
AU - Wang, Hongyu
AU - He, Ying
AU - Gu, Xianfeng
AU - Qin, Hong
PY - 2009/7
Y1 - 2009/7
N2 - Harmonic volumetric mapping aims to establish a smooth bijective correspondence between two solid shapes with the same topology. In this paper, we develop an automatic meshless method for creating such a mapping between two given objects. With the shell surface mapping as the boundary condition, we first solve a linear system constructed by a boundary method called the method of fundamental solution, and then represent the mapping using a set of points with different weights in the vicinity of the shell of the given model. Our algorithm is a true meshless method (without the need of any specific meshing structure within the solid interior) and the behavior of the interior region is directly determined by the boundary, which can improve the computational efficiency and robustness significantly. Therefore, our algorithm can be applied to massive volume data sets with various geometric primitives and topological types. We demonstrate the utility and efficacy of our algorithm in information transfer, shape registration, deformation sequence analysis, tetrahedral remeshing, and solid texture synthesis.
AB - Harmonic volumetric mapping aims to establish a smooth bijective correspondence between two solid shapes with the same topology. In this paper, we develop an automatic meshless method for creating such a mapping between two given objects. With the shell surface mapping as the boundary condition, we first solve a linear system constructed by a boundary method called the method of fundamental solution, and then represent the mapping using a set of points with different weights in the vicinity of the shell of the given model. Our algorithm is a true meshless method (without the need of any specific meshing structure within the solid interior) and the behavior of the interior region is directly determined by the boundary, which can improve the computational efficiency and robustness significantly. Therefore, our algorithm can be applied to massive volume data sets with various geometric primitives and topological types. We demonstrate the utility and efficacy of our algorithm in information transfer, shape registration, deformation sequence analysis, tetrahedral remeshing, and solid texture synthesis.
KW - Computational geometry and object modeling
KW - Computer graphics
KW - Computing methodologies
KW - Geometric algorithms
UR - https://www.scopus.com/pages/publications/68149141330
U2 - 10.1109/TASE.2009.2014735
DO - 10.1109/TASE.2009.2014735
M3 - 文章
AN - SCOPUS:68149141330
SN - 1545-5955
VL - 6
SP - 409
EP - 422
JO - IEEE Transactions on Automation Science and Engineering
JF - IEEE Transactions on Automation Science and Engineering
IS - 3
M1 - 4908967
ER -