到顶点

This thesis contributes to geometry compression in the following aspects: Proposes a method of progressive spherical mesh parameterization based on local parameterization by directly projecting the deleted vertices to its neighborhood. Based on spherical mesh paramterization, an adaptive subdivision remeshing method by progressivly redistributing of sampling points is proposed, by this means, the main geometry information of the original mesh can be captured with only a small amount of samples, it can also be used in mesh simplification. By regarding attributes binded on mesh vertices as geometry signals and transferring them onto a uint sphere by means of spherical mesh parameterization, meshes with different attributes are compressed with spherical wavelet successfully with high compression rate. As a kind of lossy geometry compression technique, two mesh simplification algorthimes are also presented in this thesis.

归纳起来，本文的主要贡献有：提出了以直接投影局部参数化方法为基础的网格累进球面参数化方法；在网格球面参数化方法的基础之上，提出了一种基于累进优化布点方案的网格细分采样方法，该方法可以用很少的采样点就可以捕获到网格的主要特征，因此我们也将其用于后面的网格简化工作当中；通过将网格顶点上定义的各种属性看成几何信号，并以网格球面参数化为手段将几何信号迁移到单位球面上，从而成功地实现了用球面小波对各种几何信号的压缩；作为一种有损压缩方法，本文还提出了基于统一距离的网格简化算法和基于重采样的网格简化算法。

Such perception lasted until the creation of impressionism in the 19th century, particularly until the appearance of Seurat as a member of Divisionism, when such perception reached the peak.

这个历史一直延续到19世纪时的印象主义时代，具体来说到了点彩派的修拉为止，可以说是达到了顶点。

Output fed to memory is expanded to individual point/line/triangle lists (exactly as they would be passed to the rasterizer).

输出到内存的是独立的顶点、直线或者三角形链表（当然也可能被送到光栅化过程中）。

To decompose prismoid subject into sweepable sub-volumes, the source vertices project into target surface and decompose target surface to many subdomains. The virtual surfaces are found by linking opposite vertices from source surface and target surface, finally cut volume to sub-volumes. It is also designed spheriform decomposition based on geometry character.

虚拟分解主要是通过将棱柱体的源曲面边界顶点映射到目标曲面，将目标曲面划分成和源曲面一一对应的区域，连接对应的顶点建立虚拟剖分曲面，利用虚拟曲面将复杂的几何体剖分成子几何体。

This can be established without a map to the right, then seeking the shortest route into the problem for a map of the rest of Vertex Vertex all the shortest path probl

这样就可以建立一个无向有权图，那么求最短的运输路线问题就转化为求图中一顶点到其余各个顶点的最短路径问题了。

The first is to choose any one of the impossible shortest path but it doesn't eliminate any of the impossible shortest path by passed top clusters to unpassed top cluster.The second is tha...

而Dijkstra原始算法仅在可能存在的多条最短路径中任选其中一条即可；2、Dijkstra算法的每一步骤，不仅要求路径最短，同时还要求经过的顶点最少，从而求出被原始算法忽略的所有可能存在的最短路径；结果最终可以求出带权图中一起始点到其余顶点的所有最段路径。

Vertices, in each m inute the ant travels from one vertex to an ad jacent vertex.

钟均会从一个顶点走到另一个相邻的顶点。

This tells Direct3D and the driver that you will be adding vertices and won't be modifying the ones that you previously batched.

这告诉D3D和设备你要添加新的顶点到缓存中，但是不改变原有顶点数据。

This tells Direct3D and the driver that you will be adding vertices and won't be modifying the ones that you divviously batched.

这告诉 D3D 和设备你要添加新的顶点到缓存中，但是不改变原有顶点数据。

The error evaluation method most frequently used in current applications is the quadric error metrics, originally proposed by Garland and Heckbert in [9], in which a quadric (represented by a symmetric, positive semi-definite matrix) is associated with each vertex, subsuming the sum of the squared distances of the vertex to all its incident planes.

当前采用的最广泛的误差评估方法是QEM方法。这个方法中，每一个顶点都与一个二次误差相关联，包含了顶点到其相邻面距离的平方和。

On the other hand, the more important thing is because the urban housing is a kind of heterogeneity products.

另一方面，更重要的是由于城市住房是一种异质性产品。

Climate histogram is the fall that collects place measure calm value, cent serves as cross axle for a few equal interval, the area that the frequency that the value appears according to place is accumulated and becomes will be determined inside each interval, discharge the graph that rise with post, also be called histogram.

气候直方图是将所收集的降水量测定值，分为几个相等的区间作为横轴，并将各区间内所测定值依所出现的次数累积而成的面积，用柱子排起来的图形，也叫做柱状图。