Routing non-convex grids without holes

[1991] Proceedings. First Great Lakes Symposium on VLSI Pub Date : 1991-03-01 DOI:10.1109/GLSV.1991.143959

Dee Parks, M. Truszczynski

引用次数: 1

Abstract

This paper is part of a complete solution of the two-terminal net routing problem for certain non-convex grids without holes that the authors call Z-grids, that part being the embedding of a non-even Z-grid routing problem in an even Z-grid routing problem. This embedding algorithm runs in time O(b), where b is the size of the boundary.<>

查看原文本刊更多论文

路由无孔的非凸网格

本文是一类无孔非凸网格(称为z网格)的两端网路由问题的完全解的一部分，即非偶z网格路由问题嵌入到偶z网格路由问题中。该嵌入算法运行时间为O(b)，其中b为边界的大小。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

[1991] Proceedings. First Great Lakes Symposium on VLSI

自引率

0.00%

发文量