顶点

Firstly, the method fits each vertex and its local neighborhood of the clothing and human models by constructing the biquadratic Bezier surface. It can estimate the Gaussian curvature and the mean curvature of each vertex. Then, the feature points of two mesh models are extracted according to curvatures.

该方法基于双二次Bezier曲面局部拟合服装模型和人体模型的网格顶点及其邻近点，估算出人体和服装模型网格顶点的高斯曲率和平均曲率，然后提取出人体和服装模型两点集的特征匹配点。

A carpel with one seed; one of a pair split apart at maturity meridian

n。 子午线，经线，顶点a。子午线的，日中的，顶点的

Now is a good time to go back to bed if you do not know what a vertex is, but in a geometry for dummies fashion, I will let you in on the secret: a vertex is the location of a point in space, usually described by its x, y and z Cartesian coordinates.

现在是一个很好的时间去回到床上如果你不知道什么是顶点，但在时装几何傻瓜，我将让你的秘密：一个顶点是一个点的位置在空间，通常是描述其x，y和z直角坐标系。

Applying the De Caen"s inequality of sum of the squares of the degree and Cauchy"s inequality, we obtain a strict lower bound and a strict upper bound of the largest Laplace eigenvalues only in terms of vertex number of a unicycle graph. Applying the Laplace matrix theorem of trees, we obtain an upper bound of the second smallest Laplace eigenvalues of a unicycle. Extremal graph whose second smallest Laplace eigenvalues reach the obtained upper bound is determined. We also obtain an upper bound of the second largest Laplace eigenvalues in terms of vertex number of the largest connected branch of unicycle graph, and obtain a theoretical method to calculate the second largest Laplace eigenvalues of unicycle graph. We obtain an upper bound of any Laplace eigenvalues in terms of vertex number of a unicycle graph. We also obtain the distribution of Laplace eigenvalues in the inter [0,n] in terms of the matching number.

本文得到了以下几个方面的结果： 1、利用图度平方和的De Caen不等式和Cauchy不等式给出单圈图的最大Laplace特征值仅依赖于顶点数的严格的上下界；利用树的Laplace理论给出了单圈图次小Laplace特征值的一个上界，并刻画了达到该上界的极图；利用子图的连通分支的顶点个数给出了单圈图次大Laplace特征值的一个上界，并给出了单圈图次大Laplace特征值一个理论上的一个求法；利用单圈图的阶数给出了其一般Laplace特征值的一个上界；利用单圈图的匹配数给出其Laplace矩阵谱在区间[0，n]上的分布情况。

Compared with volume model, surface model can greatly decrease the computing time to make it fulfill the real time computing requirement; the additional retro-force to original position is to simulate the stick behavior of soft tissue; Chain Mail and Level Tree model can quickly calculate out the vertex displacement and its spread.

相对于体模型，面模型可以大大简化计算量，使之达到实时的要求；通过增加顶点相对于原始位置的回归力部分来模拟软组织的粘滞特性；Chain Mail和Level Tree模型可以迅速实时的计算出外力作用下的顶点位移与传播。

A closed path in a graph that does not pass through any vertex more than once and passes through at least three vertices.

图中经过三个以上顶点且经过每个顶点仅一次的一条封闭路径。

By using the position information of concave vertices, a new algorithm for finding the kernel of a simple polygon was proposed,which could automatically select concave vertex to clip against polygon to obtain the kernel.

利用凹顶点间的位置信息，提出一种自动选择凹顶点来裁剪多边形的新求核算法。

For example, say we wish to know if two vertices in a graph of n vertices are in the same connected component of the graph.

举个范例，我们希望知道一个有 n 个顶点的图形中的两个顶点是否位於图中同一个连接元件。

A connected graph G of order...

一个有n个顶点的连通图被称为路稠的如果它的任意一对顶点都能被长度为2，3，…，n-1的路连接。

By the study of several typic methods of determining convexo-concave features for vertices of polygon, the computation time complexity of these methods was analysed, and those methods were implemented in VC++.

摘 要：主要针对几种典型的多边形顶点凸凹性识别算法进行研究，对它们的计算时间复杂度进行分析，并用 VC++6.0实现多边形顶点凸凹性的高效识别。

Objective To investigate the effects of interleukin-1 β converting enzyme gene on the biologic characteristics of ovarian cancer cells.

目的 探讨白细胞介素-1 β转换酶的表达，对卵巢癌细胞生物学特性的影响。

Campylobacter: This illness is the most commonly identified cause of diarrheal illness in the world.

弯曲：这种病是最常见的原因查明腹泻病，在世界上。