关联于同一条边的两个顶点成为邻接顶点（adjacent vertex）。不与任何顶点相连接 的顶点，即度为零的顶点，称为孤立顶点（isolated vertex）。
基于32个网页-相关网页
一个图G的邻域复形是以G的顶点为顶点，以G的具有公共邻接顶点的顶点子集为单形的抽象复形。
Let G be a graph and let V(G) be the vertex set of G. Define the neighborhood complex N(G) as the simplicial complex whose simplices are those subsets of V(G) which have a common neighbor.
如果两个顶点被同一条边连接，就称这两个顶点是邻接的。
Two vertices are said to be adjacent to one another if they are connected by a single edge.
对于网格模型简化问题，本文提出了一种基于网格顶点曲率加权该顶点邻接三角形面积的顶点删除简化算法。
This algorithm removes vertices of the mesh according to the curvature of the vertex weighted by the area of the triangles which are adjacent to that vertex.
应用推荐