TY - JOUR
T1 - Surface reconstruction with quartic triangular patches
AU - Ma, Lizhuang
AU - Lau, Rynson W H
AU - Li, Frederick
AU - Peng, Qunsheng
PY - 1998/12
Y1 - 1998/12
N2 - Surface reconstruction is needed in many applications, and very often, the reconstructed surface is required to be of low degree so that the surface can be computed efficiently and robustly. However, reconstructing surfaces with lower degrees are much more difficult than with higher degrees. The Cr continuous Hermite interpolant has to use a rather high polynomial degree, d≥4r+1, unless each triangle in the triangulation is subdivided into several subtriangles. In this paper, we propose a method for constructing a G1 quartic triangular B-B surface from a 3D triangulation. A sequence of triangulations are initially constructed by continuously removing a boundary vertex and all associated triangles from the 3D triangulation. According to this sequence of triangulations, an efficient algorithm is developed for constructing a smooth quartic surface over the 3D triangulation. The shape parameters in the G1 condition are determined by a corresponding 2D triangulation of the 3D triangulation. This 2D triangulation has the same topology as the 3D one. The new method has many advantages over the existing methods.
AB - Surface reconstruction is needed in many applications, and very often, the reconstructed surface is required to be of low degree so that the surface can be computed efficiently and robustly. However, reconstructing surfaces with lower degrees are much more difficult than with higher degrees. The Cr continuous Hermite interpolant has to use a rather high polynomial degree, d≥4r+1, unless each triangle in the triangulation is subdivided into several subtriangles. In this paper, we propose a method for constructing a G1 quartic triangular B-B surface from a 3D triangulation. A sequence of triangulations are initially constructed by continuously removing a boundary vertex and all associated triangles from the 3D triangulation. According to this sequence of triangulations, an efficient algorithm is developed for constructing a smooth quartic surface over the 3D triangulation. The shape parameters in the G1 condition are determined by a corresponding 2D triangulation of the 3D triangulation. This 2D triangulation has the same topology as the 3D one. The new method has many advantages over the existing methods.
UR - http://www.scopus.com/inward/record.url?scp=0032284513&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0032284513&origin=recordpage
M3 - RGC 21 - Publication in refereed journal
SN - 1000-9000
VL - 13
SP - 54
EP - 62
JO - Journal of Computer Science and Technology
JF - Journal of Computer Science and Technology
IS - Suppl
ER -