Minimum Manhattan network problem is put forward in 1999 a world-class computational geometry important conjecture.

Decomposing a simple polygon into convex cell is one of elementary problems of computational geometry.

摘要简单多边形凸单元剖分是计算几何的基本问题之一,剖分算法在许多领域均有较广泛的应用.

Being a basic structure of computational geometry, convex hull is important to data analysis of GIS.

凸壳作为计算几何的一种基本的结构,对GIS的数据分析有着重要作用.

This Handbook provides an overview of key concepts and results in Computational Geometry.

这本手册提供核心概念的概述并且导致计算几何学.

In this paper, the edge coloring of some multiple join of graphs are studied.

本文研究了若干多重联图的边染色.

Secondly, it gives two weighted convex cone independent set problems.

本文提出两个赋权凸锥独立集合问题.

The VRP and the network flow problem are all famous network optimization problems.

车辆路径问题和网络流问题都是非常著名的网络优化问题.

Chapter nine considers the minimal cost network flow problem from the simplex method point of view.

第九章从单纯形方法的观点考虑网络流问题的最小化.

Then a brand-new network flow management method by multi-agent technology is proposed to solve the problems.

在此基础上,引入多 agent 技术来解决网络流量管理难题.

The distributed computation ability of active networks provides a new approach to network flow control.

主动网络的分布式计算能力为网络流量控制提供了新途径.

Another card from the outflow is through the network flow simulation of injury.

从另一张网卡流出的就是经过模拟损伤的网络流.

The analysis of network flow.

网路流量分析.

Fig. 4 : The analysis of network flow.

图四、网路流量分析.

A novel multi-path network flow management method based on multi-agent is presented.

提出新的行之有效的基于多 agent 的多路径网络流量管理方法.

The algorithm reduces network flow effectively enhances the quality of clock-synchronization.

本算法有效的减少了网络流量,具有很高的实用质量.

Link State algorithm called the shortest path first SPF ( Short Path First ) algorithm.

链路状态算法又叫最短路径优先SPF ( ShortPathFirst ) 算法.

This article introduce a way called layer shortest path way based on conventional shortest path way.

论文中提出了一种基于常规最短路径方法的分词算法:层进式最短路径分词方法.

Redundant links that are not part of the shortest path tree are blocked.

不是最短路径的备援连结将被阻隔.

Specific functions include a 2-point shortest path between the dynamic display, the segment length annotation.

实现了VB, MO最 短路径搜索.具体功能包括,2点间最短路径动态显示, 各段长度标注.

FIGURE 5. Determining the shortest path from the origin to the destination.

图5. 决定从出发点到目标点的最短的路径.

This paper is to study the shortest path problem with fuzzy parameter.

本文研究具有模糊参数的最短路径问题.