Author Login Chief Editor Login Reviewer Login Editor Login Remote Office

›› 2004, Vol. 30 ›› Issue (S1): 487-489.

• Papers • Previous Articles     Next Articles

Method for PCB Auto Routing

ZHANG Yan   

  1. (Dept.of Computer Science and Engineering,Shanghai Jiaotong University,Shanghai 200030)
  • Published:2004-12-29

PCB自动布线算法介绍

张艳   

  1. 上海交通大学计算机科学与工程系 上海 200030

Abstract: This paper discusses data organization and obstacle tree in PCB CAD design, compares three data structures: linked lists, quad trees, and 4-d binary tree. It also introduces the application of graphic deconstruction and graphic intercross in PCB auto design.

摘要: 讨论了PCB自动设计中版面图形数据组织和障碍数的建立,比较了链表、二叉树、四维二叉树3种结构的特点。介绍了PCB自动设计 中分解算法、图形相交算法及其在图形数据处理中的应用。

关键词: 印制电路板, 计算机辅助设计, 四维二叉树, 链表, 图形分解, 图形相交, 最小限定矩形

CLC Number: