| 无网格线探索布线算法 |
| |
| 引用本文： | 杨瑞元.无网格线探索布线算法[J].计算机辅助设计与图形学学报,1998,10(3):200-207. |
| |
| 作者姓名： | 杨瑞元 |
| |
| 作者单位： | 国防科技大学计算机系 |
| |
| 摘 要： | 提出的一种高效快速的无网格线探索面线算法适用于焊盘外形尺寸不一，线宽及线间距离可变的印制电路板及ＭＣＭ电路布线，精心设计的数据结构及灵活的绕障探索方式可大大地提高搜索效率；多级多扁优化策略为改善布线结果提供了可靠的保证，该算法已成功地应用于通用印制电路板设计系统ＭＰＣＢ，取得了令人满意的效果。
|
| 关 键 词： | 无网格线探索法 印制电路板 布线 |
A GRIDLESS LINE SEARCH ROUTING ALGORITHM |
| |
| YANG Rui,Yuan.A GRIDLESS LINE SEARCH ROUTING ALGORITHM[J].Journal of Computer-Aided Design & Computer Graphics,1998,10(3):200-207. |
| |
| Authors: | YANG Rui Yuan |
| |
| Abstract: | In this paper, we propose an efficient and fast gridless line search routing algorithm . This algorithm can be applied to connection routing in PCBs and MCMs with various pad geometry and pad sizes, with different wire widths and variable distances between wires. The routing efficiency is guaranteed by delicately designed data structures and by the ability of searching around obstacles. The routing paths are improved by multi phase multi-pass refinements. The algorithm is successfully applied in our versatile PCB design system MPCB with satisfactory results. |
| |
| Keywords: | gridless line search offset for obstacle rounding searching around obstacles |
| 本文献已被 CNKI 维普 等数据库收录！ |
