顶点

After briefly reviewing the classification and history of curve and surface modeling, we discuss the characters, applications and representative work on three types of geometric approximation. And we present a survey of the vertex correspondence problem and the vertex interpolation problem in 2D and 3D shape blending modeling and key frame animation.

作者简要回顾了曲线曲面造型的分类和发展历史，论述了曲线曲面造型中所遇到的三类几何逼近问题的特点、应用和代表性工作，并就用于二维和三维形状混合造型的几何插值方法从顶点对应和顶点插值两方面做了一个系统的综述。

We have proposed an arithmetic of this kind to eliminate the vertex in a circling way,ignoring the knaggy character and the deasil or anticlockwise direction of the plane polygon.

概述了平面多边形三角形剖分的各种算法，提出了一种不考虑多边形的凸凹性、顶点顺时针或逆时针走向循环消除顶点的平面多边形三角剖分算法，并给出了实例。

Aiming at the multiple loop structures in quality management process network, an improved graph pattern mining approach based on Apriori algorithm is put forward, where a frequent pattern of size k, denoted as G, is joined with another frequent pattern of size k, denoted as G, to form a candidate frequent pattern of size (k+1), if there exists a source vertex s in G and a sink vertex e in G such that the graph derived from G by subtracting node s equals with the graph derived from G G by subtracting node e.

采用基于APriori方法的频繁活动序列挖掘算法，认为k-频繁图集中，当一个图减去其中的一个源顶点后，如果所得到的图与另一个图减去其中的一个沉顶点后的图相同时，可以连接生成一个(k+1)-候选频繁图，从而减少了传统Apriori算法迭代过程中生成的冗余候选频繁图的数目。

In order to develop a new method for creating such an object normal form, the meaning of a vertex of the directed graph is extended, such that it is not only a simple vertex, but also a directed graph.

为了研究新的对象范式生成方法，对有向图顶点的含义进行了扩充，使其不仅可以是一个简单的顶点，还可以是一个有向图。

The surface generated by a straight line,the generator,passing through a fixed point,the vertex ,and moving along a fixed curve,the directrix.

如果一个连通图的一个顶点能被分割，从而使这图成为一个不连通图，则这个顶点称为断点。

In this paper we prove Dirac conjecture for some special graphs in Which the numbers of ve-rtices are not more than 11, or have K or more vertices of degrees at least v-K-3 with v ≥9+K(K=1,2,3,), hence a proposition equivalent is given for it.

本文对顶点数不超过11或当v≥9+K(K=1，2，3)且G中至少含有K个次不小于v-K-3的顶点的特殊图证明了Dirac猜想，从而给出一个与Dirac猜想成立等价的命题。

Various methods such as the relationship of area, and the distance of the triangle to the centralness of three dots, the distance from the interior point, exterior point, the barycenter to the vertices of triangle, and the standard error and differences average obtained from three dots were determined with a dynamic geometry software GSP, and a statistic method was used to find a least error way to determine the centralness of three dots on a plane.

本研究是以平面上三点所构成的三角形之三顶点做讨论，分别以三角形的面积、周长，内心、外心和重心至三顶点距离，三点的标准差及平均差的概念，做为不同的判别方式，并以动态几何画板 GSP模拟不同的判断方法作为研究，再利用统计学上的方法，找出哪一种定义方式为最适合、误差最少的判断方法。

As a minimum, a vertex shader must output vertex position in homogeneous clip space.

顶点着色器至少要输出顶点在齐次空间中的位置。

For example,we shall be discussing graphs which contain paths which include every edge or every vertex exactly once,ending up at the initial vertex [7];such graphs will be called Eulerian and Hamiltonian graphs respectively.

例如，我们将讨论这样一些图，图中存在包含所有边或所有顶点一次且仅一次而回到出发顶点的路，我们分别称之为欧拉图和哈密尔顿图。

For Example,we shall be discussing graphs which cintain paths which include every edge or every vertex exactly once,ending upa at the initial vertex;such graphs will be called Eulerian and Hamiltonian graphs respectively.

例如，我们将讨论这样一些图，图中存在包含所有边或所有顶点一次且仅一次而回到出发顶点的路，我们分别称之为欧拉图和哈密尔顿图。

With Death guitarist Schuldiner adopting vocal duties, the band made a major impact on the scene.

随着死亡的吉他手Schuldiner接受主唱的职务，乐队在现实中树立了重要的影响。

But he could still end up breakfasting on Swiss-government issue muesli because all six are accused of nicking around 45 million pounds they should have paid to FIFA.

不过他最后仍有可能沦为瑞士政府&议事餐桌&上的一道早餐，因为这所有六个人都被指控把本应支付给国际足联的大约4500万英镑骗了个精光。