算法化

For a general parametric curve/surface, we usually cannot compute its exact implicit form. Even though its exact implicit form can be computed, the curve/surface implicitization involves relatively complicated computation and the degree is higher. Moreover, it may have unexpected components and self-intersections. All these unsatisfied properties limit the applications of the exact implicitization. So finding curve/surface approximate implicitization has become a practical problem. In this paper, we present an algorithm to solve the approximate implicitization of a given parametric curve by using a quadratic algebraic spline curve.

由于精确隐式化过程不一定可以实现，即使可以实现隐式曲线曲面的阶数高计算复杂，并且具有不希望的自交点和奇异分支，从而限制了隐式化的运用，所以寻求参数曲线曲面的近似隐式化问题成为很实际又重要的问题，提出利用二次代数样条曲线来实现一般平面参数曲线近似隐式化的一种算法。

According to the defect of different type in log, histogram balance, fast average filter, fast mediate filter, differentiation sharp, Laplace sharp operator, Sobel sharp operator, Kirsch sharp operator, etc.

针对原木中不同类型的缺陷，本文采用的处理方法有直方图均衡、快速均值滤波、快速中值滤波、微分锐化、拉普拉斯算子锐化、Sobel算子锐化、kirsch算子锐化等算法。

This dissertation firstly introduces the principles of four kinds of simple gridding methods, which are"Linear interpolation based on triangulation","Inverse distance weighted and averaged method","Modified Shepard's method"and"Multiquardirc method". Secondly, it researches the Ordinary Kriging method for geophysical irregular data, which mainly includes the base knowledge of region change and variogram and the principle of Ordinary Kriging method. Thirdly, it researches the Inverse Interpolation for geophysical irregular data, which mainly includes the principle of inverse interpolation and its iterative algorithm, and the principle of Inverse Interpolation to realize the gridding of geophysical data. Finally, it uses these gridding methods to grid theoretical model data of potential field and raw aeromagnetic data, and compares and analyzes the gridding results.

本文首先简单介绍了地球物理不规则分布数据的四种简单网格化方法(即基于三角网的线性插值法、反距离加权平均法、改进的Shepard方法和多元二次函数法)的方法原理；接着，重点研究了地球物理不规则分布数据网格化的普通克里金法，主要研究了区域变化量、变差函数的基础知识和普通克里金法的方法原理；之后，重点研究了地球物理不规则分布数据网格化的反插值法，主要研究了反插值法的方法原理和迭代求解算法，以及反插值法实现地球物理数据网格化的原理；最后，应用这些方法对理论位场模型和实际航磁数据进行了试验、对比和分析。

3D solid visualization class and 3D surface visualization class have thefunction of visualizing the scalar and vector. Moreover, 3D surface visualization classcan produce 2D data file. Picture class provides function of marking on the picture.

其次，运用 VTK 标量和矢量可视化技术实现了三维数据场的矢量和标量可视化，包括三维体数据场标量和矢量单视区显示及三维体数据场剖面标量和矢量单视区/四视区显示；使三维面数据可视化类具备了三维面数据场标量单视区显示功能和剖切面生成二维数据文件的功能，并且在三维面数据可视化类中内嵌了数据预处理算法。

Space curve is one of the basic elements in geometric modeling, and its effective representation is the basis of modeling. Parametric representation based on features is a kind of high-level representation including semantic information. In Chapter 4, para- metric representations based on features for free form space curve are investigated, and a parametric model for the loop of plain knitted fabric is established, in which 5 parameters with practical meanings are used to represent the shape of a loop and the relationship between loops. A new shrinkage prediction method for knitted fabric are proposed based on the parametric representation and energy minimizing. Experimental results on some plain knitted fabrics illustrate the feasibility of the proposed method.

空间曲线是造型中最基本的几何元素之一，对其有效的表示是造型的基础，而特征参数化表示是其中一种包含语义信息的高层次表示，本文对空间自由曲线的特征参数化表示进行研究，建立了一种针织物线圈的特征参数化几何模型，采用5个具有实际意义的参数表示织物线圈的几何形状及线圈之间的位置关系，并将该模型与能量极小化的方法相结合，得到了一种能较好地预测针织物缩水率的新模型，对随机选取的一些针织布缩水预测实验表明了算法的可行性。

A new PID algorithm which combines improved discretely integral PID and inadequacy differential PID,makes the system stabilitate faster and exacter.

控温电路采用线性化电流方式，算法上对积分分离PID算法做出改良，并与不完全微分PID算法结合形成一种优化PID算法，能快速、精确的把温差稳定到目标值，控温精度达到0.01℃。

The compressed point sample can be transferred progressively after serialization. Secondly, the thesis purposes another algorithm to render the compressed point data which can render the model without reconstructing the full structure of KD-Tree. The algorithm uses the View-Frustum Culling, Back-Face Culling and Level of Detail method, and boosts the speed and precision on rendering.

其次，提出了一个在此压缩算法上的模型快速绘制算法，该算法可以直接使用序列化后数据并不需要恢复完整的KD-树结构即可进行绘制，该算法使用了视锥裁减，背向面裁减，层次细节等方法，极大提高了绘制的速度和精度。

We analyze theoretically the various algorithms of the fundamental matrix, and suggest that the input data should remove the errors in measurements through pre-processing for the algorithm stability. The robust algorithms, the cross-ratio based algorithm and the regularized pre-revised algorithm, are presented.

通过对目前常用算法分析及数值模拟指出，要提高算法的数值稳定性，最有效的办法是直接对输入数据作预处理去除噪声，并给出了较为鲁棒的基于交比预处理算法，和正则化预处理算法。

The definition of the clustering and the algorithms in the clustering is introduced. We introduce the present situation of the clustering in time series, and now there are two kinds of clustering algorithm in time series, one is Adaptive Resonance Theory and their improvement algorithms; the other is Self-Organizing Feature Map and their improvement algorithms.

对聚类分析的概念作了简要介绍，讨论了现有的聚类分析中常用的方法以及时间序列的聚类分析的一些算法，当前聚类用于时间序列的符号化主要有两类，第一类是基于竞争学习模型的方法及其改进算法，第二类是自组织特征映射及其改进算法，本文对这两类算法分别作了探讨。

Based on analyzing the algorithms of Delaunay triangulation creation in domestic and abroad, in view of the situation of building DTM and the need of realizing railway 3D visual design, a divide-and-conquer algorithm to build DTM is presented, the algorithm use square grids to manage disordered points, to form triangular meshes in grids, DTM can be obtained by merging the triangular meshes, so that the work of sorting of the disordered points before building DTM is reduced greatly; moreover, the algorithm utilize subarea to control the vertices of convex hull so that the range which support points locate in can be predefined when searching support points, the workload of searching support points can be reduced and the speed of merging two triangulations is raised.

在分析了国内外构建DTM算法的基础上，针对DTM算法的现状及铁路线路三维可视化设计的需要，创立了一种构建DTM的分治算法。算法引入方格网管理离散点数据，在格中构建三角网，然后再将这些三角网合并形成DTM，极大地减少了构网前对所有参加构网的离散点进行排序的工作量。此外，通过对凸包顶点数据进行分区管理，在搜寻凸包支撑线时，能预先确定出支撑点的范围，减少了搜索工作量，提高了三角网的合并速度。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。