Anwendung von Plane-sweep Verfahren bei der Layouterzeugung integrierter Schaltungen

@inproceedings{Lauther1984AnwendungVP,
  title={Anwendung von Plane-sweep Verfahren bei der Layouterzeugung integrierter Schaltungen},
  author={Ulrich Lauther},
  booktitle={GI Jahrestagung},
  year={1984}
}
  • U. Lauther
  • Published in GI Jahrestagung 1984
  • Computer Science
Zunachst wird auf die Bedeutung des Kanal-Verdrahtungsproblems fur die automatische Entflechtung von VLSI-Schaltungen und auf Losungsverfahren eingegangen. Dann wird das Grundprinzip von Plane-sweep-Verfahren erlautert, die bislang vor allem in der Layoutanalyse eingesetzt wurden. Schlieslich wird die Anwendung des Plane-sweep-Prin-zips auf Channelrouter erlautert. 
1 Citations

References

SHOWING 1-10 OF 30 REFERENCES

Dogleg Channel Routing is NP-Complete

  • T. G. Szymanski
  • Computer Science
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 1985
TLDR
It is shown that an efficient optimal algorithm for interconnecting two rows of points across an intervening channel is unlikely to exist by establishing that this problem is NP-complete.

An Efficient Channel Router

  • T. Yoshimura
  • Computer Science
    21st Design Automation Conference Proceedings
  • 1984
TLDR
A new routing algorithm is presented, which is an improved version of the classical "left edge algorithm", which uses a row by row approach, calculating an optimum net assignment to each row.

Efficient Algorithms for Channel Routing

  • T. YoshimuraE. Kuh
  • Computer Science
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 1982
TLDR
Two new algorithms merge nets instead of assigning horizontal tracks to individual nets to route a specified net list between two rows of terminals across a two-layer channel in the layout design of LSI chips.

Efficient Algorithms for the Constraint Generation for Integrated Circuit Layout Compaction

TLDR
The graph problem underlying the constraint generation for VLSI circuit compaction is defined and efficient, i.e., O(nlogn) time algorithms for the generation of constraint systems that allow to change the layout topology during the conpaction in order to yield good compaction results are developed.

Wire routing by optimizing channel assignment within large apertures

TLDR
The purpose of this paper is to introduce a new wire routing method for two layer printed circuit boards based on the newly developed channel assignment algorithm and requires many via holes.

Geometric intersection problems

  • M. ShamosDan Hoey
  • Computer Science, Mathematics
    17th Annual Symposium on Foundations of Computer Science (sfcs 1976)
  • 1976
TLDR
An O(N log N) algorithm is given to determine whether any two intersect and use it to detect whether two simple plane polygons intersect and to show that the Simplex method is not optimal.

Algorithms for Reporting and Counting Geometric Intersections

TLDR
Algorithms that count the number of pairwise intersections among a set of N objects in the plane and algorithms that report all such intersections are given.

Grundlagen der Hydrologie