| 释义 |
line routing algorithm
线段［探索］布线算法
In PCB design, a routing algorithm using line segment searching instead of point by point searching. The algorithm requires less computing time and less memory. With this algorithm it is possible that routes are not found or the shortest routes are not found while they actually exist.
在印制电路板(PCB)设计中,用线段探索代替逐点探索进行布线的算法。此算法需要较少的 计算时间和存储量。但使用此算法时,有可能在实际存在路径的情况下找不到布线路径或 找不到最短路径。 |