基于面分块的三维人脸模型的边界表示方法

针对人脸造型中脸部模型的存储与表示问题,对人脸的生理结构特征进行了分析,在人脸共性的基础上,提出了一种基于面分块的三维人脸模型,并用边界表示法给出了这种模型的数据结构。按器官组织将人脸分解,各部分可以单独处理,合并起来又能构成一张完整的人脸,这种方法有利于表情的模拟和脸部动作的构造。     

基于超单元形函数坐标变换的有限元网格剖分和冷却水管网格二次剖分方法

当用Ansys的前处理模块进行网格剖分建模时,映射网格剖分受到许多条件限制而自由网格剖分不容易控制,往往不能按照自己的意愿进行网格剖分,并且剖分出来的网格不规则.针对这一问题,采用超单元网格剖分的建模思想,通过基于形函数的坐标变换,用Fortran语言编程实现网格剖分.用该方法进行网格剖分,不但易于控制网格单元形状大小,而且便于修改网格.并且,用超单元的高次形函数进行坐标变换,可以很好地对曲边曲面形状的结构模型进行网格剖分.大体积混凝土的温控防裂一直是人们非常关注的问题,而冷却水管技术是一种有效可行的温控防裂技术.在超单元的基础上实现了添加冷却水管的网格二次剖分方法,使大体积混凝土的水管冷却仿真计算得以实现.     

三角网格上细分曲面的尖锐特征造型

尽管光滑性是我们在自由曲面造型时的最主要的目标，在某些特定情况下却需要产生非光滑的特殊效果，如折痕、角、尖刺、锥等尖锐特征。本文主要研究基于Loop格式的尖锐特征的生成。一种基于网格拓扑结构的修改的方法把诸如折痕、角、尖刺、锥和交点的生成统一了起来，同时第一次由本文生成了多条折痕交点的特殊效果。实例表明由本文中方法生成的尖锐特征效果非常好。     

一种基于正则参数化的降维细分算法(英文)

In our previous work, we have given an algorithm for segmenting a simplex in the n-dimensional space into rt n＋ 1 polyhedrons and provided map F which maps the n-dimensional unit cube to these polyhedrons. In this paper, we prove that the map F is a one to one correspondence at least in lower dimensional spaces （n _〈 3）. Moreover, we propose the approximating subdivision and the interpolatory subdivision schemes and the estimation of computational complexity for triangular Bézier patches on a 2-dimensional space. Finally, we compare our schemes with Goldman＇s in computational complexity and speed.     

Wavelets for multichannel signals

In this paper, we introduce and investigate multichannel wavelets, which are wavelets for vector fields, based on the concept of full rank subdivision operators. We prove that, like in the scalar and multiwavelet case, the existence of a scaling function with orthogonal integer translates guarantees the existence of a wavelet function, also with orthonormal integer translates. In this context, however, scaling functions as well as wavelets turn out to be matrix-valued functions.     

New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions

Abstract

The well-known Jahn-Graef-Younes algorithm, proposed by Jahn in 2006, generates all minimal elements of a finite set with respect to an ordering cone. It consists of two Graef-Younes procedures, namely the forward iteration, which eliminates a part of the non-minimal elements, followed by the backward iteration, which is applied to the reduced set generated by the previous iteration. Without using the backward iteration, we develop new algorithms that also compute all minimal elements of the initial set, by combining the forward iteration with certain sorting procedures based on cone-monotone functions. In particular, when the ordering cone is polyhedral, computational results obtained in MATLAB allow us to compare our algorithms with the Jahn-Graef-Younes algorithm, within a bi-objective optimization problem.     

对VC中子类化技术的探讨

在Windows编程中，适当的使用子类化技术，不但可以大大增强应用程序的功能，还可以满足软件的特殊要求。就控件子类化技术和窗口子类化技术分别进行了探讨。     

芭蕉扇的细分图T_n~*的和数

芭蕉扇T_n指在扇F_n=P_n(?)K_1的轴K_1上悬挂一条边所得的图,该边叫T_n的柄,P_n上的边叫缘边,其余边叫辐。芭蕉扇细分图T_n~*是T_n的缘边各剖分一次所得的图。本文证明了芭蕉扇细分图T_2~*是模和图,且σ(T_n~*)(?)=2,n=2、3,≤2,n≥4     

On the selection of subdivision directions in interval branch-and-bound methods for global optimization

This paper investigates the influence of the interval subdivision selection rule on the convergence of interval branch-and-bound algorithms for global optimization. For the class of rules that allows convergence, we study the effects of the rules on a model algorithm with special list ordering. Four different rules are investigated in theory and in practice. A wide spectrum of test problems is used for numerical tests indicating that there are substantial differences between the rules with respect to the required CPU time, the number of function and derivative evaluations, and the necessary storage space. Two rules can provide considerable improvements in efficiency for our model algorithm.The work has been supported by the Grants OTKA 2879/1991, and MKM 414/1994.     

体模型的一种细分格式

In this paper, a subdivision scheme which generalizes a surface scheme in previous papers to volume meshes is designed. The scheme exhibits significant control over shrink-age/size of volumetric models. It also has the ability to conveniently incorporate boundaries and creases into a smooth limit shape of models. The method presented here is much simpler and easier as compared to MacCracken and Joy‘s. This method makes no restrictions on the local topology of meshes. Particularly, it can be applied without any change to meshes of nonmanifold topology.