Orthogonal circuit visualization improved by merging the placement and routing phases

Eschbach, Thomas; Günther, Wolfgang; Becker, Bernd

doi:10.1109/icvd.2005.134

Cited by 3 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Thật vậy, cấu trúc đồ thị đã chứng minh được tầm quan trọng của mình trong rất nhiều lĩnh vực như: mạng xã hội [1], kỹ nghệ phần mềm [2], thiết kế mạch điện [3], thiết kế cơ sở dữ liệu [4] … Một cách tổng quát hơn, cấu trúc đồ thị có thể mô hình hóa các loại dữ liệu thể hiện dưới dạng tập các đối tượng và quan hệ giữa các đối tượng đó.…”

Section: Giới Thiệuunclassified

Mô Hình Lực Cho Biểu Diễn Đồ Thị Phân Nhóm

Định¹,

Dkaki²

2016

Fair - Nghiên Cứu Cơ Bản Và Ứng Dụng Công Nghệ Thông Tin 2015

View full text Add to dashboard Cite

Section: Giới Thiệuunclassified

Mô Hình Lực Cho Biểu Diễn Đồ Thị Phân Nhóm

Định¹,

Dkaki²

2016

Fair - Nghiên Cứu Cơ Bản Và Ứng Dụng Công Nghệ Thông Tin 2015

View full text Add to dashboard Cite

“…Then we extend the framework with a new step which dynamically reorders iteratively two nodes in one layer and repeats the orthogonal embedding of the hyperedges to further reduce the number of hyperedge crossings until a local optimum is reached. This new approach [14] combines the placement and routing process with respect to the hypergraph structure in contrast to many known heuristic methods. Since finding exact solutions for both steps together means to traverse a huge search space, two fast heuristic methods are used by turns to compute the final solution.…”

Section: Introductionmentioning

confidence: 99%

Orthogonal Hypergraph Drawing for Improved Visibility

Eschbach¹,

Günther²,

Becker³

2006

JGAA

View full text Add to dashboard Cite

Visualization of circuits is an important research area in electronic design automation. One commonly accepted method to visualize a circuit aligns the gates to layers and uses orthogonal lines to connect the gates. In our model we assume that between two consecutive layers every net is allowed to occupy only one track. This avoids unnecessary bends in the wires and helps to improve the clarity of the drawing. Then a crossing reduction step is applied to further improve the readability of the circuit schematics.First we assume that the nodes have already been fixed on a layered hypergraph structure. We consider the problem of assigning the hyperedges between two layers to tracks. The idea is to minimize the total number of hyperedge crossings. We prove that finding the best solution is NP-hard. Then, in contrast to many other approaches which route all the wiring after placing all nodes we focus on a new approach which dynamically reorders the nodes within the layers to further reduce the number of hyperedge crossings. An efficient algorithm is presented that minimizes the hyperedge crossings. Experimental results are provided which show that the drawings can be improved significantly while the running time remains moderate.

show abstract

Orthogonal hypergraph routing for improved visibility

Eschbach

Günther

Becker

2004

Proceedings of the 14th ACM Great Lakes Symposium on VLSI

View full text Add to dashboard Cite

Visualization of circuits is an important research area in electronic design and automation. One commonly accepted method to visualize a circuit aligns the gates to layers and uses orthogonal lines to connect the gates. Our approach introduces the restriction that every net is allowed to occupy only one track. This avoids unnecessary bends in the wires and helps to improve the clarity of the drawing. Then a crossing reduction step is applied to further improve the readability of the circuit schematics.In this paper we assume that the nodes have already been fixed on a layered hypergraph structure. We consider the problem of assigning the hyperedges between two layers to tracks. The idea is to minimize the total number of hyperedge crossings. First, we prove that finding the best solution is NP-hard. Then, we present a new heuristic to reduce the number of crossings. Finally, some promising experimental results on real circuits are given. The results show that in the majority of cases, the layout produced by our algorithm are within 3% of the optimal solution.

show abstract

Orthogonal circuit visualization improved by merging the placement and routing phases

Cited by 3 publications

References 16 publications

Mô Hình Lực Cho Biểu Diễn Đồ Thị Phân Nhóm

Mô Hình Lực Cho Biểu Diễn Đồ Thị Phân Nhóm

Orthogonal Hypergraph Drawing for Improved Visibility

Orthogonal hypergraph routing for improved visibility

Contact Info

Product

Resources

About