It computes a single cycle time for all intersections, splits this cycle time into green times for each intersection and then adjusts offset times in order to minimise waiting times.
这项技术为所有交叉口计算一个单一的周期时间并将这个周期时间分割成每一个交叉口的绿灯时间，而后调整相位差，以便将等待时间减至最少。
The algorithm proposed by us for polygonal chains intersection based on the sweep line algorithm is extended, and it is used to detect and delete global self-intersections in the rough offset curve.
拓展了我们已有的平面上单调链求交的扫描线算法，将其应用到初步等距线中的全局自交点和全局无效环的确定上。
应用推荐