Engineering change orders (ECOs) are pervasively applied to modern physical design of nanometer integrated circuits for cost-effective design changes. After applying ECO, a net may become open, which results in a large number of disconnected net components. Each net component further consists of a set of connected net shapes and vias on different layers. It is very challenging to efficiently and effectively identify all disconnected net components and find an obstacle-avoiding minimal-cost routing path among those net components. This paper introduces an open-net finder and an open-net connector based on the corner-stitching data structure for open-net routing, and proposes a new method of constructing a multilayer obstacle-avoiding component-to-component rectilinear minimum spanning tree. The preliminary idea and implementation of the proposed method had received the first place award in ICCAD-2017 CAD contest. This paper further details the complete idea of the proposed method. Experimental results show that the proposed open-net finder and connector outperform the top three open-net routers in the ICCAD-2017 CAD contest and two latest published works, with better routing costs and much shorter runtime.

中文翻译：

---

基于角拼接的多层避障组件到组件直线最小生成树构造

工程变更单 (ECO) 普遍应用于纳米集成电路的现代物理设计，以实现具有成本效益的设计变更。应用 ECO 后，网络可能会打开，从而导致大量断开的网络组件。每个网络组件进一步由一组连接的网络形状和不同层上的通孔组成。高效且有效地识别所有断开的网络组件并在这些网络组件中找到避免障碍的最小成本路由路径是非常具有挑战性的。本文介绍了一种基于角缝数据结构的开放网络路由的开放网络查找器和开放网络连接器，并提出了一种构建多层避障组件到组件直线最小生成树的新方法。该方法的初步构思和实现在ICCAD-2017 CAD竞赛中获得一等奖。本文进一步详细介绍了所提出方法的完整思想。实验结果表明，所提出的开放网络查找器和连接器的性能优于 ICCAD-2017 CAD 竞赛中的前三名开放网络路由器和两个最新发表的作品，具有更好的布线成本和更短的运行时间。