An O ( n log n ) algorithm for obstacle-avoiding routing tree construction in the λ-geometry plane

EBOARST: An Efficient Edge-Based Obstacle-Avoiding Rectilinear Steiner Tree Construction Algorithm

“…In this section, we provide the experimental results on several commonly used test cases [8], [10], [24], [28]. We have implemented our algorithm in C++ language and compiled it using gcc 3.4.6.…”

“…Hence, the interconnects are not allowed to run over them most of the time. Consequentially, obstacle-avoiding RSMT (OARSMT) construction arises as a more practical problem and has attracted renewed attention in the VLSI physical design community [8]- [15].…”

“…More recent OARSMT heuristics proposed in the literature adopt different strategies [8]- [11], [13]. They mainly fall into two categories.…”

“…Three algorithms proposed lately also fall into this category [8], [10], [11]. The connection graph used by Feng et al [8] is the so-called obstacle-avoiding constrained Delaunay triangulation, while in the approaches of Shen et al [11] and Lin et al [10], spanning graphs are used.…”

“…The connection graph used by Feng et al [8] is the so-called obstacle-avoiding constrained Delaunay triangulation, while in the approaches of Shen et al [11] and Lin et al [10], spanning graphs are used. The later steps are common to all: A minimum terminal spanning tree (MTST, defined in Section IV-B) over this connection graph is generated and then refined to become a Steiner tree using heuristics.…”