一个图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.

youdao

基于平面欧几里得图和抽象胞腔复形理论，提出了街道网矢量数据的渐进式表达模型。

A progressive representation model for street networks of vector data was presented based on the theory of plane Euclidean graph and abstract complex cell.

youdao