TY - GEN
T1 - Locally adjustable interpolation for meshes of arbitrary topology
AU - Lai, Shuhua
AU - Cheng, Fuhua
AU - Fan, Fengtao
N1 - Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2007
Y1 - 2007
N2 - A new method for constructing a smooth surface that interpolates the vertices of an arbitrary mesh is presented. The mesh can be open or closed. Normals specified at vertices of the mesh can also be interpolated. The interpolating surface is obtained by locally adjusting the limit surface of the given mesh (viewed as the control mesh of a Catmull-Clark subdivision surface) so that the modified surface would interpolate all the vertices of the given mesh. The local adjustment process is achieved through locally blending the limit surface with a surface defined by non-uniform transformations of the limit surface. This local blending process can also be used to smooth out the shape of the interpolating surface. Hence, a surface fairing process is not needed in the new method. Because the interpolation process does not require solving a system of linear equations, the method can handle meshes with large number of vertices. Test results show that the new method leads to good interpolation results even for complicated data sets. The new method is demonstrated with the Catmull-Clark subdivision scheme. But with some minor modification, one should be albe to apply this method to other parametrizable subdivision schemes as well.
AB - A new method for constructing a smooth surface that interpolates the vertices of an arbitrary mesh is presented. The mesh can be open or closed. Normals specified at vertices of the mesh can also be interpolated. The interpolating surface is obtained by locally adjusting the limit surface of the given mesh (viewed as the control mesh of a Catmull-Clark subdivision surface) so that the modified surface would interpolate all the vertices of the given mesh. The local adjustment process is achieved through locally blending the limit surface with a surface defined by non-uniform transformations of the limit surface. This local blending process can also be used to smooth out the shape of the interpolating surface. Hence, a surface fairing process is not needed in the new method. Because the interpolation process does not require solving a system of linear equations, the method can handle meshes with large number of vertices. Test results show that the new method leads to good interpolation results even for complicated data sets. The new method is demonstrated with the Catmull-Clark subdivision scheme. But with some minor modification, one should be albe to apply this method to other parametrizable subdivision schemes as well.
UR - http://www.scopus.com/inward/record.url?scp=38349004771&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38349004771&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-76858-6_9
DO - 10.1007/978-3-540-76858-6_9
M3 - Conference contribution
AN - SCOPUS:38349004771
SN - 9783540768579
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 88
EP - 97
BT - Advances in Visual Computing - Third International Symposium, ISVC 2007, Proceedings
T2 - 3rd International Symposium on Visual Computing, ISVC 2007
Y2 - 26 November 2007 through 28 November 2007
ER -