带约束的动态Delaunay三角剖分算法研究

根据传统的三角网格生长算法和数据点渐次插入算法,改进了带约束的动态Delaunay三角剖分算法,进一步得到了优化三角网格的动态三角剖分算法,改进了以往三角剖分算法必须知道所有顶点后才能进行剖分的缺点,并引入合理的约束边插入算法,使得最终三角网格达到最优.     

An improved general bidirectional progression model for arterial

Optimal control of arterial signals is critical for the effective operation of urban road network. With the goal of providing reasonable allocation of bidirectional green time while maximizing general bidirectional traffic progression along the arterial, this paper develops an improved general bidirectional coordinated progression model for arterial based on Maxband model. In the model, a proportional coefficient of bidirectional bandwidth demands is introduced and calibrated by adopting average link queue occupancy. The calibration method takes full account of actual traffic volume and capacity of each link, which helps to provide optimal control performance. Additionally, new constraints are added into the model and enable the model with two features: it can automatically select two-way or one-way progression, and the involved intersection unit can be either one-phase-one-approach or bidirectional symmetric release mode. The results of extensive simulation studies indicate that the improved model outperforms existing methods, markedly increasing the utilization of available bidirectional green time.     

地表模型上的最短路径算法研究

提出了一种基于空间三角网格的地表模型上的最短路径算法。该算法利用离散点的空间信息计算得到起点So到周围邻接点的最短距离，然后用逐步向外层边界扩展的方法扩大起点的邻接点范围，直到起点的邻接点中包含终点to。此过程可求得So到to的最短路径上的关键点，然后求取无原始边连接的2个关键点之间的精确路径点。