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.
The formation and structural features of adjacency list are described.
介绍了邻接表的形成方法和结构特点。
4.
Joining two nonadjacent vertices of a polygon.
对角线的连接多边形任意两个不相邻顶点的直线的
5.
You can create your vertex shader in two ways (that I know).
创建顶点着色程序你可有两种方法。
6.
Our neighbor doesn't show much emotion. He's a bit of a cold fish.
我们的邻居不太表露情感，他有点冷漠。
7.
Adjacent: Rooftop squares are not considered adjacent to ground squares.
邻接：屋顶方格与地面方格不视为临接。
8.
Establish the adjacency relation among all pairs of components which share a pair of pseudovertices.
在所有共享一对伪顶点的二个分量间建立相邻关系。
9.
Singularity of Adjacency Matrix of Graphs with Exactly One Copoint Bicycle
恰有一公共点的双圈图的邻接矩阵的奇异性
10.
Research of Assembly Sequence Planning of AOV-network Sort for Virtual Assembly
面向虚拟装配的“顶点表示活动”网络排序装配顺序规划的研究
11.
FRAME CONTACT LIFT (SINGLE POST)
框架接触顶起点(单点)
12.
Let u and v be nonconsecutive vertices on c.
设u和v是c上不相邻的两个顶点。
13.
If the edges are ordered pairs of vertices then we get the notions of a directed graph and directed multigraph.
如果边都是顶点的有序对，则得到有向图和有向重图的概念。
14.
diameter of top circular-arc juncture circle
齿顶圆弧衔接点圆直径
15.
Climbing Down Ladders: A creature on a rooftop and next to a ladder square can spend2 squares of its movement to climb downthe ladder.
爬下楼梯：生物所占据的屋顶方格有邻接著楼梯方格时，可以使用2格的行动力来爬下楼梯。
16.
In between each neighboring vertex of a mesh, you typically create edges to connect them.
在多边形上的很个相邻的点之间，通常有边把它们连接在一起。
17.
Two edges are adjacent if they have exactly one common endvertex.
如果两条边恰有一个公共端点，就说它们是邻接的。
18.
a pointed arch; usually has a joint (instead of a keystone) at the apex.
一种尖角拱；在顶点通常有一个接合点（而不是拱心石）。