查询词典 triangulation

In chapter 4, an optimization Boolean operator of triangular mesh and the algorithm of adding point-swapping edge locally are put forward. With boundary traced by adding midpoint, the triangulation of 2D arbitrary domain is realized. The fast searching method which combines the index rectangle with compass based normal vector is designed to speed the triangulation algorithm.

第四章提出了一种优化的三角网格布尔运算和逐点加入—局部换边法，用中点加点法恢复边界，实现了二维任意域Delaunay三角化算法，用索引矩形和基于法矢的指南针法相结合的快速查询法有效地提高了三角化算法的速度，给出了二维任意域三角网格剖分的实例。

Triangulation over a convex 2-D domain is implemented by advancing front technique and circumcircle optimizing method, while the triangulation over an arbitrary 2-D domain needs more restriction of the visibility between points.

对于边界已知的平面区域的三角剖分，按照网格前沿方法和外接圆优化准则实现凸边界的平面区域Delaunay剖分，而对于凹边界区域的三角剖分，需增加可见性判断准则，实现对其的三角剖分。

Speckle is also the fundamental uncertainty factor in this kind of sensors. The analytic expression of centroid uncertainty limit is derived from the statistic of laser speckle, and it is shown that the uncertainty limit in RST, and also in anamorphic triangulation, is dependent on the solid angle subtended by entrance pupil as seen from the illuminated laser spot, the triangulation angle, as well as the laser wavelength. The influence of aberration of optical system and surface roughness are also discussed.(4) A method of getting the 3D edge characters based on the integrated vision system is studied.

重点研究了RST中的激光散斑现象，从散斑统计学的角度，首次推导了激光散斑引起的旋转对称三角法位移测量不确定度的极限，结果表明在光学粗糙表面上，该极限由投射激光波长，光学系统入瞳对投射光斑所张的立体角，以及光学系统主光轴与旋转轴的夹角确定；这一结论同样适用于其他变形成像的激光三角法。4基于RST的工作方式，研究了利用集成视觉系统的扫描移动来获得被测物体的低分辨率三维信息的方法。

Because of the condition of 〓 for two neighbour parametricspline surfaces is too strong,here,instead of it,some simple and practicableconditions of 〓 resulted from the general theorem obtained by Prof.LiuDing Yuan in Chapter 1 were proved,and three 〓 triangular splinesurfaces schemes wre presented:one is piecewise cubic spline surface patcheshaving local 〓 and whole 〓 continuity based on the refined HCTtriangulation,another is the same degree spline surface patches but based onthe refined Powell-Sabin triangulation,the third is piecewise quartic splinesurface patches having local 〓 and whole 〓 continuity based on therefined P-S triangulation.

由于对参数曲面，一阶导数连续的要求较强，我们采用第一章从刘鼎元定理导出的简单实用的几何连续条件，讨论了基于HCT加细三角剖分和P-S加细三角剖分上的两种局部达一阶导数连续而整体有一阶几何连续的分片三次样条曲面构造算法，一种局部达二阶导数连续整体有一阶几何连续的分片四次样条曲面构造方法。

This paper presents a novel triangulation algorithm based on the normal information of the surface and the Delaunay triangulation algorithm.

借助于曲面上的法矢信息和三维Delaunay三角剖分算法，该文给出了一种新的散乱点三角剖分算法。

Furthermore, the paper presents a line oriented locating algorithm for fast locating triangles, which has the advantage of unique path and steady operation compared with other locating algorithms.2 Applying the theory of Constraint Delaunay Triangulation, the paper propounds the dynamical algorithm for constructing CDT, which insist that the constraint segments be inserted into the triangulation as soon as possible on the condition that they have been known already.

同时提出了快速定位三角形的直线方向定位算法，该算法与一般方向定位算法相比，具有搜索路径唯一，运行稳健的特点。 2应用约束Delaunay三角网理论，提出了构建CDT的动态算法，提出在约束条件已知的情况下，应尽早嵌入约束边。与传统构建CDT的"两步法"相比，具有速度快，点集可以动态扩充的优点。

First, based on the criterion of Delaunay triangulation for the plane scattered points set, the article proposes the general triangulation for arbitrary scattered points in plane domain.

基于平面区域内散乱点的Delaunay三角剖分准则，本文提出一种适用于平面区域内任意散乱点的通用三角化算法。

Basing on the concepts and algorithms, some traditional algorithms, e.g. Delaunay triangulation for planar polygonal domain, constrained Delaunay triangulation for planar points and Delaunay tetrahedralization for spatial points, are improved.

通过上述概念和算法，改进了多边形Delaunay三角剖分、平面散乱点集约束Delaunay三角剖分和空间散乱点集Delaunay四面体剖分等基于生长算法的传统数据生成方法。

Based on data cloud, which is measured from 3-coordinate measuring machine or so, an algorithm to search lopological structure from 3D unorganized points using Envelopment-box technology is proposed in this thesis. Based on this method, we searching neighbor points of sampling point. We also improve the Max-Min angle criteria to realize local triangulation, and then get the normal of sampling point from the triangulation. Using the normal and neighbor relationship, classification of scattered data points is realized according to the quadric surface.

本文以测量得到的曲面数据点点云为基础，提出了一种基于包围盒的自动寻找三维散乱数据点之间拓扑结构的方法，采用该方法寻找采样点的邻域结点，并对三角剖分中的典型优化准则—最小内角最大准则提出了改进，按照改进后的优化准则实现了采样点的局部三角划分，并进一步求解得到采样点的法向量，依据法向量及邻域拓扑关系在二次曲面的基础上实现了散乱数据曲面重构中的数据点的自动分类。

A new triangulation algorithm based on Delaunay triangulation and the advantage of simplicity and rapidness of advancing front method is constructed.

将推进波前法的实现简单和快速的特性引入到Delaunay三角剖分法之中，构建一种基于Delaunay三角剖分的算法。

The French are not suggesting a new EU treaty, but they have plenty of other wheezes.

法国人并不是在建议签署一个新的欧盟条约，但他们有许多其他的阴谋。

This letter was written by my brother.

这封信是我弟弟写的。