1) edge graph
边图
2) face-edge graph
面边图
1.
This paper presents an algorithm based on face-edge graph to identify and suppress fillet features.
提出一种基于面边图的圆角特征识别和抑制算法,根据三维模型建立面边图,使圆角特征的识别转化为在面边图中寻找割点或割集的过程,从而实现对圆角特征的识别和抑制。
3) half edge graph
半边图
1.
The probably solution of complex combination optimizm problem can describe by half edge graphs,designed a extrude intake algorithm for graph,this algorithm can solve manufacturing cell design problem.
用半边图来描述复杂组合优化问题的可能解,在此基础上设计了针对图的挤出吸入算法,用此算法求解了一个典型的复杂组合优化问题,制造单元设计问题。
2.
Half edge graph theory can represent complex structure and various constraint accurately.
用半边图来描述复杂组合优化问题的可能解,在此基础上设计了针对图的拆分重组算法,用此算法求解了一个典型的复杂组合优化问题,制造单元设计问题。
3.
Multi-way half edge graph partitioning problem with redundant plan paths is the complex combination optimizm problem that has various constraint.
计划路径可选的半边图划分问题是一类含有多种局部约束的复杂组合优化问题。
4) general edge graph
广义边图
1.
For any weighted graph G=(V,E), it is firstly converted into its general edge graph G′=(V′,E′) through mapping from edges to ver.
对于任一赋权图G=(V,E),首先通过边到点映射把它转换为广义边图G′=(V′,E′)。
5) jiubian tulun
《九边图论》
6) time-varying half-edge graph
时变半边图
1.
According to scale-free networks theory,time-varying half-edge graph of dynamic resources relationships was presented.
模拟无尺度网络特性提出资源动态关联的时变半边图,进而利用超分子自组装机制建立超分子资源模型,超分子资源再被赋予环境动态感知、自主行为决策和协同等能力,形成自主元素。
2.
Expanding the normal representation of resources relationships, a time-varying half-edge graph topology model was proposed to describe the attributed relationships of Internet resources.
引入半边概念描述Internet资源的特征属性,为网络环境下各类资源特征属性建立一个统一描述框架;扩展一般情况下的资源关系表示图,提出了资源属性关系的时变半边图模型;以网络的无尺度特性作为资源关联关系的演化规律的理论依据,给出时变半边图的一个具体生成算法。
参考词条
补充资料：边图
1.边境地图。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。