三角点

The point where the anterior branch of axillary nerve crosses the line junction the acromion to the deltoid tuberosity lies below the acromion (6.19±0.49) cm, and it corresponds to the junction of upper 2/5 and lower 3/5 of the length of the deltoid muscle.

腋神经前支于肩峰外侧端与三角肌止点连线相交点位于肩峰下(6.19±0.49)cm，相当于肩峰与三角肌止点连线间三角肌长度的上2/5与下3/5交点。

This method has some excellent characters such as quick speed, automatic deleting of yawp points. Topologic reconstruction method gets the optimized meshes by reconstructing the umbrella shape of every point and deleting antipathic triangles. This method has wide applied range and quick speed.

点集拓扑重建算法是采用局部构造的思想，对每一个点构造它周围的伞形，最后得到整体的三角网格，并对网格中的不相容三角形进行删除，最后得到优化的三角网格，该算法适用范围广，并且速度较快。

To solve the accuracy and the recognizing effect problems for fingerprint matching in the progress of fingerprint recognition, and considering the triangulation of cupidity algorithm in computational geometry and leading it into the fingerprint matching, a method for fingerprint matching which based on trigonometric grid is proposed.

针对指纹识别过程中的指纹匹配算法的准确性以及识别效果等问题，结合计算几何中平面点集的三角剖分方法－贪心算法的特点，将其引入指纹匹配处理，提出了一种基于三角网格（用贪心算法进行平面点集的三角剖分）的指纹匹配方法。

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三角剖分准则，本文提出一种适用于平面区域内任意散乱点的通用三角化算法。

The definition of Halton points is introduced and the algorithm complexity is analyzed, then the sampling strategy of triangle plane is introduced, including geometry region partitioning, coordinate mapping between triangle plane and rectangle plane, and computing principle to the coordinates of sampling point. The experiment results compared with Jittered sampling and improved LHS sampling are given.

给出了Halton点的定义，分析了其算法复杂度，在此基础上给出了三角平面的采样策略，包括几何区域的划分、三角平面与矩形平面的坐标映射、采样点坐标计算原理；并将该方法与Jittered采样法、改进的LHS采样法进行了比较。

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.

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

Due to the irregular distribution of space mesh data, the contour of surface cannot be gained from coordinate of points directly. So a method to detect edges of triangular mesh surface is brought out in this passage.

由于空间网格数据分布不规则，不能从点的坐标直接得到曲面的边界，因此提出了一种空间三角网格曲面的边界提取方法，通过判断一个点的邻接点是否都能通过三角网格的边组成闭合曲线来获取边界点。

The triangulating algorithm for discrete surface is presented.

在空间离散点曲面的三角划分方面，提出了限定相邻三角片的法线夹角的空间离散点曲面三角网格划分方法。

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，极大地减少了构网前对所有参加构网的离散点进行排序的工作量。此外，通过对凸包顶点数据进行分区管理，在搜寻凸包支撑线时，能预先确定出支撑点的范围，减少了搜索工作量，提高了三角网的合并速度。

Firstly, because the triangle constrained matching propagation begins with the initial corresponding triangulations formed by a few seed points in the stereo pairs, this dissertation studies the affects of different numbers and different distributions of seed points on the image matching results through experimental analysis, and proposes a seed point selection strategy for different image texture conditions, an automatic selection algorithm is also designed that gives good distribution quality for a defined number of seed points.

首先，针对匹配传播过程中的种子点选取问题，通过实验分析研究了不同数量与分布的种子点所构成的初始三角网对匹配结果的影响，进而提出了不同影像条件下的种子点选取策略和一种自动提取一定数量、满足一定分布均匀度的种子点自动选取算法；其次，研究了海量数据情况下同名三角网的快速构建、数据组织存储与局部动态更新的方法；在此基础上，本文提出了随机传播、基于三角形拓扑关系的邻近传播和顾及纹理特征的自适应传播等三种传播策略，分别介绍了其详细的实现算法，并通过实验分析对这几种传播策略进行了比较，实验结果证明自适应传播方法在匹配的可靠性上最优。

I didn't watch TV last night, because it .

昨晚我没有看电视，因为电视机坏了。

Since this year, in a lot of villages of Beijing, TV of elevator liquid crystal was removed.

今年以来，在北京的很多小区里，电梯液晶电视被撤了下来。