Obstacle-Avoiding Rectilinear Steiner Minimal Tree construction

We present a construction-by-correction approach to solve the obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction problem. We build an obstacle-weighted spanning tree as a guidance to construct OARSMT on an escape graph. We use Dijkstra's algorithm for routing. A refinement...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Yung-Tai Chang, Ya-Wen Tsai, Jun-Cheng Chi, Mely Chen Chi
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Buildings Pins Routing Steiner trees Tree graphs Very large scale integration Wire
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!