1) neighborhood graph
邻域图表示
1.
Two efficient new algorithms for topological and geometric compression are developed in this paper, which are based on a new kind of neighborhood graph representation and coordinates ordering techniques.
三角网格的拓扑连接关系可以由顶点之间的连接边确定,与网格曲面每一顶点有一条边连接的顶点构成网格的邻域,网格顶点及其一邻域点集构成网格的邻域图表示。
2) neighborhood list
邻域表
1.
To balance the performance of algorithm and running time,this paper proposes a multi-objective evolutionary algorithm based on neighborhood list whose structure is similar with that of adjacent list in graph theory.
针对算法性能和运行时间的矛盾,提出一种基于邻域表的多目标进化算法(NLEA)。
4) Web Neighborhood Graph
Web邻域图
1.
Web Neighborhood Graph Construction for Topic Distillation Algorithms;
主题精选算法中Web邻域图的构造
5) Neighborhood hypergraph
邻域超图
6) 2-adjacency representation
双近邻表示
1.
A 2-adjacency representation was presented in this paper.
提出了一种双近邻表示法。
补充资料：邻域
邻域
neighbourhood
邻域【.吨仙仪们.闭;0冲ec，Oc、}，拓扑空间中点x(集合A)的 该空间中含有点x(集合A)的任何开集.有时，该拓扑空间中任何集合，如果其内部含有点x(集合A)，也称为点x(集合A)的邻域(亦见集合的内部(interiorofaset)). B.A.nacHHK.撰胡师度、白苏华译
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条