插值特殊曲线的可展曲面造型研究进展

可展曲面一直是计算机辅助几何设计领域中的热点问题,其在曲线曲面造型中有着很好的应用前景.另外,它与逼近论、最优化、微分几何、线几何等领域密切相关,并产生了一些很好的数学结果.本文主要综述可展曲面的一些基本结果及作者近年来在该方向的一些研究工作,并对未来工作进行展望,主要包括具有一定几何约束的可展曲面的构造和拼接等.     

一类具有任意次数的参数多项式极小曲面

极小曲面是在几何造型设计中有着重要应用的一类特殊曲面.本文从几何造型的视角提出一类次数任意的参数多项式极小曲面.所提出的极小曲面具有显式的参数表示,并具有一些重要的几何性质,如对称性、包含直线和自交性.根据几何性质,本文将该参数多项式极小曲面划分为4类:n=4k+1,n=4k+2,n=4k+3,n=4+4,其中n是极小曲面的次数,k是正整数.本文给出与之相对应的共轭极小曲面的显式参数形式,并实现其等距变形.     

矩形域上Bernstein-Hézier多项式曲面的凸性

在计算机辅助几何外型设计(CAGD)中,设计对象(主要是曲线和曲面)的形状控制是确保造型设计成功的一个重要因素.这里,形状控制包括整体形状(曲线、面的总体布局)控制和局部形状(曲线、面上每点的凸性)控制两部分.一般,前者可利用造型曲线、     

旋转曲面的有理Bernstein—Bezier表示

本文考察了较更为一般的情况,证明了旋转曲面表为有理二次、三次Bernstein-Bézier曲面的充要条件,导出了一系列适用于计算机辅助几何设计和体素造型的算法公式,最后还给出了球面有理B-B表示的三个实例。     

近似可展曲面的构造及应用

1引言经典微分几何中Gauss曲率为零的曲面称为可展曲面,它是一种特殊的直纹面．可展曲面有且只有三种,即锥面、柱面和切线面,它对于自由曲面造型具有重要的意义．例如,如果物体外壳是可展曲面,那么它可以没有形变地展开到平面上,从而可以用平板材料无形变地设计出来．这一性质对于造船业、航空业中的外形设计具有重要的意义．关于可展曲面的微分几何性质,可以在任何一本微分几何教材中找到,例如[3]．可展曲面可以说是微分几何中比较简单的一类曲面,但是在计算机辅助几何设计(CAGD)和计算机图形学中至今还不存在简单有效的设计方法．在[1,2,5]以及它们的参考文献中     

NURBS曲面的形状修改的一种方法

NURBS曲面是计算机辅助几何设计和计算机图形中最常用的参数曲面。本文采用NURBS曲面的齐次坐标表示，给出了通过控制顶点和权因子同时改变来修改NURBS曲面形状的一种方法。     

具有特殊坐标曲线网的B\'ezier曲面

在计算机辅助几何设计中, B\''ezier曲面是一类重要的参数曲面.在微分几何中,坐标曲线网也是重要的研究内容.本文中,我们对具有特殊坐标曲线网(如正交曲线网、曲率曲线网、共轭曲线网等)的B\''ezier曲面进行研究.此外,我们还构造了满足能量约束的特殊B\''ezier曲面,给出了基于控制结构的充分条件并给出具体实例.     

曲线几何连续性及其应用

曲线、曲面的几何连续性问题在计算几何、计算机辅助几何设计及图形学中愈来愈引起人们的注意,见.由于几何连续性是曲线、曲面的内在几何性质,它的研究标志着人们对自由曲线、曲面的研究提高到一个新的阶段.另一方面.由于几何连续性比参数连续性具有更多的自由度,因而在几何连续性基础上的曲线、曲面造型具有更大的灵活性,便于构造更复杂的曲线、曲面并对自由曲线、曲面进行设计、修改和处理.因此、几何连续性问题正在成为计算机辅助几何设计的一个重要课题.     

Bézier曲线和B样条曲线光顺拟合法

§1.引言 在计算机辅助几何设计(CAGD)工作中,适用于曲线造型的方法主要有样条函数、Bezier曲线和B样条曲线等。在实际工作中,几何外形设计又大致可以分成两类: (1)从头设计。按照给定的几个原始设计参数,决定曲线的特征多边形顶点,继而决定曲面的特征网格。在[1],[2]中所作的叶片和船体曲面造型,就是一种从头设计方案。 (2)模型设计。例如,传统的汽车车身设计,首先由美工师塑造一只车身的油泥模     

Bézier曲面片光滑连接的几何条件

曲面造型是计算几何领域中一个重要的研究方向,它在汽车、造船、航空、模具等行业的外形设计和制造中有着广泛的应用,目前还在发展之中.Bézier 曲面和 B 样条曲面是当前曲面造型的两大主要方法,各有长处,互相补充.B 样条曲面具有连续性高,整体配置顶点的优点.Bézier 曲面则有装配灵活、适应性强的优点.我们将矩形域和三角域两种 Bézier 曲面片混合造型,几乎可以构造出任意形状的曲面,而这对 B 样条曲面说来则     

Least-Squares Fitting of Algebraic Spline Surfaces

We present an algorithm for fitting implicitly defined algebraic spline surfaces to given scattered data. By simultaneously approximating points and associated normal vectors, we obtain a method which is computationally simple, as the result is obtained by solving a system of linear equations. In addition, the result is geometrically invariant, as no artificial normalization is introduced. The potential applications of the algorithm include the reconstruction of free-form surfaces in reverse engineering. The paper also addresses the generation of exact error bounds, directly from the coefficients of the implicit representation.     

Efficient Global Optimization of Expensive Black-Box Functions

In many engineering optimization problems, the number of function evaluations is severely limited by time or cost. These problems pose a special challenge to the field of global optimization, since existing methods often require more function evaluations than can be comfortably afforded. One way to address this challenge is to fit response surfaces to data collected by evaluating the objective and constraint functions at a few points. These surfaces can then be used for visualization, tradeoff analysis, and optimization. In this paper, we introduce the reader to a response surface methodology that is especially good at modeling the nonlinear, multimodal functions that often occur in engineering. We then show how these approximating functions can be used to construct an efficient global optimization algorithm with a credible stopping rule. The key to using response surfaces for global optimization lies in balancing the need to exploit the approximating surface (by sampling where it is minimized) with the need to improve the approximation (by sampling where prediction error may be high). Striking this balance requires solving certain auxiliary problems which have previously been considered intractable, but we show how these computational obstacles can be overcome.     

The discrete Plateau Problem: Algorithm and numerics

We solve the problem of finding and justifying an optimal fully discrete finite element procedure for approximating minimal, including unstable, surfaces. In this paper we introduce the general framework and some preliminary estimates, develop the algorithm, and give the numerical results. In a subsequent paper we prove the convergence estimate. The algorithmic procedure is to find stationary points for the Dirichlet energy within the class of discrete harmonic maps from the discrete unit disc such that the boundary nodes are constrained to lie on a prescribed boundary curve. An integral normalisation condition is imposed, corresponding to the usual three point condition. Optimal convergence results are demonstrated numerically and theoretically for nondegenerate minimal surfaces, and the necessity for nondegeneracy is shown numerically.

     

A martingale approach to minimal surfaces

We provide a probabilistic approach to studying minimal surfaces in R³. After a discussion of the basic relationship between Brownian motion on a surface and minimality of the surface, we introduce a way of coupling Brownian motions on two minimal surfaces. This coupling is then used to study two classes of results in minimal surface theory, maximum principle-type results, such as weak and strong halfspace theorems and the maximum principle at infinity, and Liouville theorems.     

Compactification of moduli space of harmonic mappings

We introduce the notion of harmonic nodal maps from the stratified Riemann surfaces into any compact Riemannian manifolds and prove that the space of the energy minimizing nodal maps is sequentially compact. We also give an existence result for the energy minimizing nodal maps. As an application, we obtain a general existence theorem for minimal surfaces with arbitrary genus in any compact Riemannian manifolds. Received: 1 April 1997; revised: 15 April 1998.     

Minimal Surfaces in the Heisenberg Group

We investigate the minimal surface problem in the three dimensional Heisenberg group, H, equipped with its standard Carnot–Carathéodory metric. Using a particular surface measure, we characterize minimal surfaces in terms of a sub-elliptic partial differential equation and prove an existence result for the Plateau problem in this setting. Further, we provide a link between our minimal surfaces and Riemannian constant mean curvature surfaces in H equipped with different Riemannian metrics approximating the Carnot–Carathéodory metric. We generate a large library of examples of minimal surfaces and use these to show that the solution to the Dirichlet problem need not be unique. Moreover, we show that the minimal surfaces we construct are in fact X-minimal surfaces in the sense of Garofalo and Nhieu.     

Singular Sturmian separation theorems on unbounded intervals for linear Hamiltonian systems

In this paper we develop new fundamental results in the Sturmian theory for nonoscillatory linear Hamiltonian systems on an unbounded interval. We introduce a new concept of a multiplicity of a focal point at infinity for conjoined bases and, based on this notion, we prove singular Sturmian separation theorems on an unbounded interval. The main results are formulated in terms of the (minimal) principal solutions at both endpoints of the considered interval, and include exact formulas as well as optimal estimates for the numbers of proper focal points of one or two conjoined bases. As a natural tool we use the comparative index, which was recently implemented into the theory of linear Hamiltonian systems by the authors and independently by J. Elyseeva. Throughout the paper we do not assume any controllability condition on the system. Our results turn out to be new even in the completely controllable case.     

Approximating rational triangular Bézier surfaces by polynomial triangular Bézier surfaces

An attractive method for approximating rational triangular Bézier surfaces by polynomial triangular Bézier surfaces is introduced. The main result is that the arbitrary given order derived vectors of a polynomial triangular surface converge uniformly to those of the approximated rational triangular Bézier surface as the elevated degree tends to infinity. The polynomial triangular surface is constructed as follows. Firstly, we elevate the degree of the approximated rational triangular Bézier surface, then a polynomial triangular Bézier surface is produced, which has the same order and new control points of the degree-elevated rational surface. The approximation method has theoretical significance and application value: it solves two shortcomings-fussy expression and uninsured convergence of the approximation-of Hybrid algorithms for rational polynomial curves and surfaces approximation.     

Willmore Surfaces in S n

A surface x> : M S ⁿ is called a Willmore surface if it is a critical surface of the Willmore functional. It is well known that any minimal surface is a Willmore surface and that many nonminimal Willmore surfaces exists. In this paper, we establish an integral inequality for compact Willmore surfaces in S ⁿ and obtain a new characterization of the Veronese surface in S ⁴ as a Willmore surface. Our result reduces to a well-known result in the case of minimal surfaces.