对偶图

词组短语

dual figure · dual graph

与对偶图相关的网络例句 [注：此内容来源于网络，仅供参考]

In this paper, firstly, the embeddability of near-triangular graphs on the orientable surface is studied. By using Petersen's Theorem about 1-factor, we first prove that for a near-triangulation on the orientable surface, its geometry dual graph has a 1-factor; then after a procedure of operation leaded by the 1-factor, we show that if a graph G triangulates some orientable surface S_g, then G has a near-triangular embedding in S_h for h = g,g + 1,...,β(G/2」, where β is the Betti number of G. Hence we obtain a conclusion: A near-triangulation of the orientable surface is upper-embeddable. As a generalization, a class of near-quadrangulation is studied, and similar results are obtained.

本文首先研究了近三角剖分图的可定向曲面嵌入性质，通过运用Petersen关于1-因子的定理，首先证明了对于可定向曲面上的三角剖分图，其几何对偶图具有1-因子；然后在1-因子的导向下，通过做一系列增加亏格的手术，证明了如果一个图G三角剖分可定向曲面S_g，那么G可以近三角剖分可定向曲面S_h，这里h=g，g+1，…，「β(G／2」，β是指图G的Betti数，从而得出推论：可定向曲面上的三角剖分图是上可嵌入的，作为推广，又研究了一类近四角剖分图的可定向曲面嵌入性质，并得到类似的结论。

The model was preprocessed to assure the regulation of facets, create the dual graph of it, and then adapt Reeb Graph to extract the skeleton which contains enough information of the model, such as gesture and topological features, to be able to be used as descriptor of 3D model retrieval.

通过对模型进行一定的预处理保证面片的规则，定义面片间距离计算方法，创建模型的对偶图，识别连通分量，在连通分量上应用Reeb图的计算思想抽取原模型的骨架。试验表明，该算法具有较好的计算效果和效率，最终的骨架保存了模型的拓扑连通性以及姿态，可用于基于内容的三维模型检索时的特征描述符。

Considering the particularity of the road network and the demand of the shortest path algorithm for the road network information, a new method of representation and storage of the road network to enhance the real-timeness of the shortest path algorithm was proposed based on the basic idea of the dual graph representation to improve the forward star structure.

考虑实际道路网络的特殊性以及最短路径算法对路网信息的要求，运用对偶图法的基本思想对前向关联边结构进行了改进，提出了一种能够提高路径优化算法实时性的路网表达方法与数据存储结构，并用Dijkstra和A*最短路径算法进行了验证。

This paper emploies a collection of discrete and limit topological events which simulates topological changes of Delaunay diagrams,the dual graph of Voronoi diagrams,to realize maintaining Voronoi diagrams of moving points.

通过一组离散的，有限的事件序列对其对偶图Delaunay图拓扑改变过程的模拟来实现对移动点Voronoi图拓扑结构的维护。

Based on the dual relation between flow graph and potential graph,flow graph represent the trusses and potential graph represent the mechanisms,obtained the duality relation between trusses and mechanisms.

基于流图和势图的对偶关系以及基尔霍夫定律，用流图表示桁架，势图表示机构，建立了桁架和机构的对偶关系。

However it allows edges or elements to straddle between subdomains. In order to be used in conjunction with element-based Godunov algorithm, the RSB algorithm partitions the dual graph of the computational meshes, e.g.

为了将递归谱对分法与以单元为主的Godunov方法结合使用，本文将该方法用于Delaunay非结构网格的对偶图Voronoi图，然后再根据Voronoi图中的结点与Delaunay网格中的三角形单元之间的一一对应关系，得到Delaunay网格的分区。

Based on the triangulation of the state space of a robot, a dual graph was constructed following the target attractive principle, and then a path planning algorithm was presented to find a sequence of adjacent triangles that were traversed by the shortest path.

对机器人的状态空间进行三角划分，根据目标吸引原理来建立其对偶图，针对对偶图提出路径规划算法得到最短路径穿越的三角形序列。

Firstly,a node-based topology relationship model of transport network is presented,in which the physical connection and the logical connection are described.Secondly,the structure of search node is defined in the sight of dual graph theory as a solution for turn prohibitions and delays in road intersections.

提出了基于节点的交通网络拓扑关系模型，描述交通网络的物理连通性以及逻辑连通性；根据对偶图的思想，定义搜索节点结构，处理交叉口转向限制和延误；改进传统的Dijkstra算法，提出了基于搜索节点的双向启发式A*算法，使用二叉堆优先级队列存储扩展节点，RB-tree存储标记节点。

The concept and properties of Voronoi diagram of a point set within an arbitrary 2D domain, i.

本文同时阐述了它的对偶图：任意域内点集的Voronoi图的概念和性质。

This implies the existence of a polynomially bounded algorithm to find a shortest contractible cycle, a shortest separating cycle, and shortest cycle in an embedded graph in the projective plane and answers the open problems raised by Mohar and Thomassen in the case of projective plane embedded graph.

另一方面，通过定义嵌入图的几何对偶图及其相应的嵌入系统，得到几何对偶图中的可分离圈就对应于原图中的割；反之，若几何对偶图中的割在原图中对应于一个圈，那么该圈一定可分离。

与对偶图相关的网络解释 [注：此内容来源于网络，仅供参考]

dual curve：对偶曲线

dual cone 对偶锥 | dual curve 对偶曲线 | dual figure 对偶图

dual figure：对偶图

dual curve 对偶曲线 | dual figure 对偶图 | dual form 对偶形式

dual form：对偶形式

dual figure 对偶图 | dual form 对偶形式 | dual formula 对偶公式

dual form：对偶形

双重控制系统 dual control system | 对偶形 dual form | 对偶图 dual graph

dual form：对偶式

"对偶图","dual graph" | "对偶式","dual form" | "对偶原理","principal of duality"

dual formula：对偶公式

dual form 对偶形式 | dual formula 对偶公式 | dual graph 对偶图

dual graph：对偶图

dual formula 对偶公式 | dual graph 对偶图 | dual group 特贞群

dual ideal：对偶理想子环

对偶图 dual figures | 对偶理想子环 dual ideal | 对偶同构 dual isomorphism

self-dual matrix：自对偶矩阵

自对偶图 self-dual graph | 自对偶矩阵 self-dual matrix | 自对偶系统 self-dual system

self-dual graph：自对偶图

自对偶函数 self-dual function | 自对偶图 self-dual graph | 自对偶矩阵 self-dual matrix