给出了求解代数曲面上两点之间测地线的一种算法。在算法中，把决定代数曲面测地线的微分方程组离散为一个非线性方程组，然后采用迭代数值方法求解。为此，给出了一种基于细分的初值生成方法。最后给出了一些数值算例用来验证算法的有效性。

Discrete filtering of information over triangulated surfaces has proved very useful in computer graphics applications. This technique is based on diffusion equations and has been extensively applied to image processing, harmonic map regularization and texture generating, etc. [C. L. Bajaj and G. Xu, ACM Trans. Graph., 22 (2003), pp. 4–32], [C. Wu, J. Deng, and F. Chen, IEEE Trans. Vis. Comput. Graph., 14 (2008), pp. 666–679]. However, little has been done on analysis (especially quantitative analysis) of the behavior of these filtering procedures. Since in applications mesh surfaces can be of arbitrary topology and the filtering can be nonlinear and even anisotropic, the analysis of the quantitative behavior is a very difficult issue. In this paper, we first present the discrete linear, nonlinear, and anisotropic filtering schemes via discretizing diffusion equations with appropriately defined differential operators on triangulated surfaces, and then use concepts of discrete scale-spaces to describe these filtering procedures and analyze their properties respectively. Scale-space properties such as existence and uniqueness, continuous dependence on initial value, discrete semigroup property, grey level shift invariance and conservation of total grey level, information reduction (also known as topology simplification), and constant limit behavior have been proved. In particular, the information reduction property is analyzed by eigenvalue and eigenvector analysis of matrices. Different from the direct observation of the local filtering to the diffusion equations and other interpretation methods based on wholly global quantities such as energy and entropy, this viewpoint helps us understand the filtering both globally (information reduction as image components shrink) and locally (how the image component contributes to its shrink rate). With careful consideration of the correspondence between eigenvalues and eigenvectors and their features, differences between linear and nonlinear filtering, as well as between isotropic and anisotropic filtering, are discussed. We also get some stability results of the filtering schemes. Several examples are provided to illustrate the properties.

In this paper, we introduce a new type of splines—polynomial splines over hierarchical T-meshes (called PHT-splines) to model geometric objects. PHT-splines are a generalization of B-splines over hierarchical T-meshes. We present the detailed construction process of spline basis functions over T-meshes which have the same important properties as B-splines do, such as nonnegativity, local support and partition of unity. As two fundamental operations, cross insertion and cross removal of PHT-splines are discussed. With the new splines, surface models can be constructed efficiently and adaptively to fit open or closed mesh models, where only linear systems of equations with a few unknowns are involved. With this approach, a NURBS surface can be efficiently simplified into a PHTspline which dramatically reduces the superfluous control points of the NURBS surface. Furthermore, PHT-splines allow for several important types of geometry processing in a natural and efficient manner, such as conversion of a PHT-spline into an assembly of tensor-product spline patches, and shape simplification of PHT-splines over a coarser T-mesh. PHT-splines not only inherit many good properties of Sederberg’s T-splines such as adaptivity and locality, but also extend T-splines in several aspects except that they are only C1 continuous. For example, PHT-splines are polynomial instead of rational; cross insertion/removal of PHT-splines is local and simple.

An algorithm is presented to compute the self-intersection curves of a rational ruled surface based on the theory of μ-bases. The algorithm starts by constructing the principal subresultants for a μ-basis of the rational ruled surface. The principal subresultant coefficients provide information about not only the parametric loci of the self-intersection curves, but also the orders of the self-intersection curves. Based on this observation, an efficient algorithm is provided to compute the parametric loci of the self-intersection curves as well as their corresponding orders. The isolated singular points of the rational ruled surface are also computed.

提出了一种散乱点的参数化方法和两个拟合算法来解决用圆盘和球域控制点Bézier/B样条曲线和曲面拟合散乱数据的问题，还设计了一些例子来说明这些算法。

This paper discusses implicitization and parametrization of quadratic surfaces with one simple base point. The key point to fulfill the conversion between the implicit and the parametric form is to compute three linearly independent moving planes which we call the weak μ-basis of the quadratic surface. Beginning with the parametric form, it is easy to compute the weak μ-basis, and then to find its implicit equation. Inversion formulas can also be obtained easily from the weak μ-basis. For conversion from the implicit into the parametric form, we present a method based on the observation that there exists one self-intersection line on a quadratic surface with one base point. After computing the self-intersection line, we are able to derive the weak μ-basis, from which the parametric equation can be easily obtained. A method is also presented to compute the self-intersection line of a quadratic surface with one base point.

This paper addresses the problem of spherical parametrization, i.e., mapping a given polygonal surface of genus-zero onto a unit sphere. We construct an improved algorithm for parametrization of genus-zero meshes and aim to obtain high-quality surfaces fitting with PHT-splines. This parametrization consists of minimizing discrete harmonic energy subject to spherical constraints and solving the constrained optimization by the Lagrange-Newton method. We also present several examples which show that parametric surfaces of PHT-splines can be constructed adaptively and efficiently to fit given meshes associated with our parametrization results.

Developable surfaces have wide applications in free form surface mod-eling. In the three dimensional space, there is not always a regular developable surface that interpolates a given boundary which is an arbitrary piecewise closed curve. In this paper, we discuss how to construct an approximate developable surfaces interpolating a closed curve. We construct a surface, in tensor-product polynomial surface space, which minimizes the Ganssian curvature of the surface in some sense, where the nonlinear optimization problem is solved by trust region algorithm and quasi Newton method in optimization theory. The result is applied, as an application, into texture mapping in computer graphics, and a method is proposed to decrease the distortion.

Parametric and implicit forms are two common representations of geometric objects. It is mportant to be able to pass back and forth between the two representations, two processes called parameterization and implicitization, respectively. In this paper, we study the parametrization and implicitization of quadrics (quadratic parametric surfaces with two base points) and cubic surfaces (cubic parametric surfaces with six base points) with the help of μ-bases-a newly developed tool which connects the parametric form and the implicit form of a surface. For both cases, we show that the minimal μ-bases are all linear in the parametric variables, and based on this observation, very efficient algorithms are devised to compute the minimal μ-bases either from the parametric equation or the implicit equation. The conversion between the parametric equation and the implicit equation can be easily accomplished from the minimal μ-bases.

Data-extrapolating (extension) technique has important applications in image processing on implicit surfaces and in level set methods. The existing data-extrapolating techniques are inefficient because they are designed without concerning the specialities of the extrapolating equations. Besides, there exists little work on locating the narrow band after data extrapolating-a very important problem in narrow band level set methods. In this paper, we put forward the general Huygens’ principle, and based on the principle we present two efficient data-extrapolating algorithms. The algorithms can easily locate the narrow band in data extrapolating. Furthermore, we propose a prediction–correction version for the data-extrapolating algorithms and the corresponding band locating method for a special case where the direct band locating method is hard to apply. Experiments demonstrate the efficiency of our algorithms and the convenience of the band locating method.