提出了一种新的隐式曲面高质量三角化方法。
We present a new high quality tessellation method for implicit surfaces in this paper.
删除网格顶点而产生的“拓扑洞”由局部三角化来修补。
The topological holes left over by lattice vertex deletion are patched by local triangulation.
该文提出确定机构奇异位置的两种方法：三角化法和矩阵法。
In this paper, triangular method and matrix method have been suggested inorder to determine singular position of mechanisms.
基于质点-弹簧模型的曲面准对称化展开算法展开三角化曲面；
Surfaces are flattened with quasi-symmetrically distributed triangle strips based on a mass-spring model.
提出了一种基于参数曲面三角化的复杂曲面刀具轨迹生成方法。
Based on the triangulation of parametric surface, a new method of tool path generation for complicated multi surfaces is presented.
这是一个很不错的地理信息系统所用到的三角化程序，是VB写的。
This is a very good geographic information systems used by the triangulation procedure is written in VB.
基于双向映射的曲面层次网格化展开算法展开高度复杂的三角化曲面。
High complex surfaces are flattened with hierarchy meshes based on bi-mapping.
提出了一个适用于任意平面多边形区域及散乱点集的通用三角化算法。
A general algorithm of triangulating arbitrary planar polygonal domain and scattered point set is presented.
三角化曲面上的网格顶点和网格边被抽象为质点-弹簧模型，用来控制网格形状。
Vertices and edges on the triangulated surface are abstracted into a mass-spring model which is used to control the shape of triangles.
本文给出了双线性系统系数矩阵的李括号条件，在此条件下，可使双线性系统状态三角化。
Lie bracket conditions of matrices of bilinear control systems are given in the paper. Under these conditions the states of a bilinear system can be triangularized.
提出了在三角网简化过程中重新三角化的若干准则，并给出了基于边扩张的三角网重构算法。
Meanwhile, the criteria of re triangulation during the simplification of triangulation net are put forward, and the re...
在数值方面，本文还提出了利用矩阵的块结构采取顺序正交三角化的方法，减轻了内存的困难。
With respect to numerical values, it is suggested that to adopt methods of matrix block structure and sequential orthogonal triangularization, can save computer storage.
实验结果表明，该方法对于随机生成的简单多边形域三角化速度快，平均计算时间呈近似线性。
The tested analysis shows that for simple polygonal domains randomly generated, the algorithm is efficient in computation and has an almost linear run time.
提出了基于四叉树和三角化方法的一种简单、快速且有效的平面结构区域内网格自动生成方法。
A simple, speedy but efficient algorithm for automatic mesh generation over arbitrary polygonal domain is proposed in this paper.
在传统多边形内点自动生成算法的基础上，提出了一种基于多边形三角化理论的内点自动生成算法。
On the base of analyzing the traditional methods of making polygon node, this paper puts forward a new method to automatically create node based on Triangulation Theory.
文中详述了三角化的具体实现过程和在三角化过程中可能出现的各种“接触”情况，给出了程序流程图。
Second, the implementation of this algorithm and the possible cases in the triangulating process are explained in detail. At the same time, the article gives the flowchart.
在局部三角化中考虑了三角形内角和顶点距离，采用规格化最小顶点距离法实现局部三角化，避免了狭长三角形出现。
A new re-triangulation method based on normalized minimum-vertex-distance was presented to avoid long and thin triangles, and it considered the vertex distance and the interior Angle of triangle.
利用计算几何的相关算法，把矢量数据的节点和边界线作为TIN网三角形的端点和边，对TIN网的局部进行三角化。
Utilizing related algorithms of computational geometry to triangulate TIN partly to make node and line as vertex and side of triangles.
本文研究了点插值法中以单项式为基函数的形函数的建立及其性质，并通过矩阵三角化算法来克服形函数矩阵大奇异性。
This paper presents the construction of the shape functions using the monomial basic function and describes the properties of the shape functions.
利用AC IS的三角化功能，以圆角刀为例，讨论了干涉量的计算与消除，提出了计算刀具外形相对四周三角片的位置。
In this thesis, the writer takes advantage of ACIS triangulating fuction and takes rounded corner tool for example to discuss calculation and elimination of interference.
设计方案中对已有的数字高程模型进行加密内插，使用三角化方法来计算地表曲面面积，采用参考平面法实现区域通视分析。
Then triangulation is used for the calculation of a polygon's surface area, and viewshed analysis is carried out using the method of reference plane.
在分析了多种颜色聚类方法的基础上，提出了2种无监督的二维色度平面颜色聚类方法：基于密度的三角化方法和遗传算法优化方法，并通过实验对2种方法进行了比对分析。
After analysing manifold color clustering methods, we present two unsupervised methods based on 2-d chroma plane, i. e, the density-based triangulation method and the GA-based optimization method.
在分析了多种颜色聚类方法的基础上，提出了2种无监督的二维色度平面颜色聚类方法：基于密度的三角化方法和遗传算法优化方法，并通过实验对2种方法进行了比对分析。
After analysing manifold color clustering methods, we present two unsupervised methods based on 2-d chroma plane, i. e, the density-based triangulation method and the GA-based optimization method.
应用推荐