1.
Ordered Adjacency Vertex List Structure for Subdivision Surfaces
细分曲面的有序邻接顶点表数据结构
2.
Removes the selected vertex from the curved line and reconnects the line between the two adjacent vertices
删除曲线上所选顶点并重新连接相邻两顶点间的线条
3.
Joining two nonadjacent vertices of a polygon.
对角线的连接多边形任意两个不相邻顶点的直线的
4.
Adjacent: Rooftop squares are not considered adjacent to ground squares.
邻接：屋顶方格与地面方格不视为临接。
5.
FRAME CONTACT LIFT (SINGLE POST)
框架接触顶起点(单点)
6.
Let u and v be nonconsecutive vertices on c.
设u和v是c上不相邻的两个顶点。
7.
diameter of top circular-arc juncture circle
齿顶圆弧衔接点圆直径
8.
A New Polygon Filling Algorithm Based on Pertinence Between Point and Its Abutting Sides
基于顶点与邻边相关性的多边形填充算法
9.
The formation and structural features of adjacency list are described.
介绍了邻接表的形成方法和结构特点。
10.
An anchor-pair based optimal adjacent anchor disambiguation WA method
基于最优邻接锚点消歧的词对齐方法
11.
a straight line joining the apex and a point on the base.
连接顶点和底面上的一个点的直线。
12.
Then place the creature on the rooftop in a legal position next to the ladder square.
然后，将该生物放到邻接楼梯方格的合法屋顶位置。
13.
Establish the adjacency relation among all pairs of components which share a pair of pseudovertices.
在所有共享一对伪顶点的二个分量间建立相邻关系。
14.
connecting the crossbeam to the apex of a triangular truss.
连接大梁和三角孔桁梁顶点的支柱。
15.
Broadband access and numerous information outlets provide a high（此处楼书印成了 hign） quality Internet environment.
宽带接入，信息点充足，顶级网络环境。
16.
Smooth - Smooths out a mesh by moving each vertex towards the barycenter of the linked vertices.
光滑-通过向连接顶点的重心移动每个顶点来光滑一个网格物体。
17.
Singularity of Adjacency Matrix of Graphs with Exactly One Copoint Bicycle
恰有一公共点的双圈图的邻接矩阵的奇异性
18.
An Algorithm for Seeking Monitor-Nodes Measuring Network Traffic Based on Adjacency Matrix
基于邻接矩阵的网络流量检测点设置算法