1) redundancy vertex
冗余顶点
1.
Algorithm for fast filtering redundancy vertex in STL solid based on Hashtable;
基于哈希表的STL面片冗余顶点快速滤除算法
2) redundancy on diagram
撒点(冗余)
3) redundant nodes
冗余节点
1.
A novel redundant nodes aggregation tree algorithm(RNAT) is presented in consideration of the plentiful redundant nodes in some wireless sensor networks.
针对某些特定场合无线传感器网络中存在大量冗余节点造成网络资源浪费的问题,提出一种新的冗余节点融合树算法(简称RNAT)。
4) redundant node
冗余结点
1.
In most batch construction algorithms of the concept lattice,With the mass nodes being built,namely,redundant nodes dissatisfying with the most expansibility of extent,some nodes of the same intension are repeatedly created.
大多数概念格批处理构造算法,由于产生大量不满足外延最大扩展性的结点即冗余结点,导致相同内涵的结点重复生成,降低了概念格的构造效率。
5) Redundant data filtering
冗余点过滤
6) collinear point redundancy
共线点冗余
补充资料：顶点
①角的两条边的交点；锥体的尖顶。②最高点；极点：比赛的激烈程度达到了～。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条