An algorithm for topology reconstruction is promoted that takes as input an unorganized set of points with known density and carries out as output simplicial surfaces.
提出了一种基于曲面局平特性的，以散乱点集及其密度指标作为输入，以三角形分片线性曲面作为输出的拓扑重建算法。
The model is based on a collection of a divisional terrain data defined as simplicial complexes arranged into a partially ordered set by time and space.
模型把子区域地形几何数据定义为单纯复合形集，按地形变化时间顺序和空间关系组织成一个偏序集。
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.
一个图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.
一个图G的邻域复形是以G的顶点为顶点，以G的具有公共邻接顶点的顶点子集为单形的抽象复形。
应用推荐