Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 電機工程學系
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/43085
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor顏嗣鈞(Hsu-Chun Yen)
dc.contributor.authorYi-Ting Linen
dc.contributor.author林奕廷zh_TW
dc.date.accessioned2021-06-15T01:36:11Z-
dc.date.available2010-07-22
dc.date.copyright2009-07-22
dc.date.issued2009
dc.date.submitted2009-07-16
dc.identifier.citation1. H. Nagamochi and N. Yamada, 'Counting edge crossings in a 2-layered drawing'. Information Processing Letters, 2004. 91: pp. 221-225.
2. K. Sugiyama, S. Tagawa, and M. Toda, 'Methods for visual understanding of hierarchical system structures'. IEEE Transitions on Systems, Man, and Cybernetics, 1981. 11(2): pp. 109-125.
3. P. Eades and N. Wormland, 'Edge crossings in drawings of bipartite graphs', in Algorithmica. 1994, Springer New York. pp. 379-403.
4. P. Kuntz, B. Pinaud, and R. Lehn, 'Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm'. Journal of Heuristics, 2006. 12(1-2): pp. 23-36.
5. V. Dujmović, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosemand, M. Suderman, S. Whitesides, and D.R. Wood, 'On the parameterized complexity of layered graph drawing', in Lecture Notes in Computer Science. 2001, Springer Berlin. pp. 1-15.
6. C. Bachmaier and M. Forster, 'Crossing reduction for hierarchical graphs with intra-level edges', Technical Report MIP-0608, 2006, University of Passau, Germany
7. C. Bachmaier, F. Brandenburg, W. Brunner, and G. Lovász, 'Cyclic leveling of directed graphs', in Graph Drawing: 16th International Symposium, GD 2008, Greece, September 21-24. 2008. pp. 348-359.
8. E. Mäkinen and M. Sieranta, 'Genetic algorithms for drawing bipartite graphs', in International J. Computer Mathematics. 1994. pp. 157-166.
9. H.A.D. do Nascimento and P. Eades, 'A focus and constraint-based genetic algorithm for interactive directed graph drawing', Technical Report Number 533, 2002, University of Sydney
10. T. Eloranta and E. Makinen, 'TimGA: a genetic algorithm for drawing undirected graphs', in Divulagciones Matematicas. 2001. pp. 155-171.
11. Q.-G. Zhang, H.-Y. Liu, W. Zhang, and Y.-J. Guo, 'Drawing undirected graphs with genetic algorithms '. Lecture Notes in Computer Science, 2005. 3612: pp. 28-36.
12. J. Utech, J. Branke, H. Schmeck, and P. Eades, 'An evolutionary algorithm for drawing directed graphs', in Proceedings of the 1998 International Conference on Imaging Science, Systems, and Technology. 1998, CSREA Press. pp. 154-160.
13. H. C. Purchase, 'Metrics for graph drawing aesthetics'. Journal of Visual Languages and Computing, 2002. 13(5): pp. 501-516.
14. M. R. Garey and D. S. Johnson, 'Crossing number is NP-complete'. SIAM Journal on Algebraic and Discrete Methods, 1983. 4(3): pp. 312-316.
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/43085-
dc.description.abstract有向圖之圖形製圖在生活中有相當多的應用,本研究主要針對「分層布置圖」作探討。分層布置圖概略來說,是將點分布在不同的「層」上,且盡可能使所有的邊均往下指的一種製圖結構。透過這種圖,希望可讓使用者能更輕易的了解各點之間的層次關係。
分層布置圖的繪製主要以Sugiyama於1981年所提出的演算法為最傳統、經典的方式。其演算法主要將此問題分為四個步驟:迴圈去除、點層級的配置、邊交叉去除、點水平位置微調。這四個步驟,分別針對單一個美學項目作佳佳化的處理,其中有三步為NP-困難問題。因此,也有許多研究在各個步驟上。
然而,這四個步驟所處理的問題,並非相互獨立的,甚至是相互矛盾的。四個問題同時要為最佳解便無法定義,意即無法同時取得最佳解。在這種情況下,這些美學指標彼此之間的取捨變成了一個重要的課題。但在傳統方法中,四個問題為相互獨立解決,這些問題之間的比重便無法取捨,造成結果不符合人眼美學準則的情況。
在調整各項準則比重的觀點下,我們提出了一基因演算法,將傳統方法前三個步驟的問題一同考慮,希望做出更符合人眼美學準則的結果。
zh_TW
dc.description.abstractDrawings of directed graphs have many applications on many different media in our daily lives. This thesis focuses on layered layouts of directed graphs. In brief, a layered layout is a topology in which nodes are distributed over several layers and all edges are directed downward as much as possible. In this layout, people could easily understand the layered relation between nodes.
The classical technique of drawing layered layouts was proposed by Sugiyama in 1981. This technique involves four steps: cycle removal, layer assignment, crossing reduction, and x-coordinate assignment. Optimization issues associated with the first three steps under this framework are NP-hard. As a result, heuristic approximation algorithms have been proposed in the literature for the first three steps of Sugiyama’s algorithm.
It is important to note that the four problems which are solved by the four steps are not independent, in the sense that in respective aesthetic criteria may contradict each other. For this reason, it is impossible to define what the optimum of all aesthetic criteria is. In other words, it is impossible to achieve an optimal solution for all aesthetic criteria at the same time. Hence, the choice for each criterion becomes a very important problem. On the other hand, even if each step could get the optimal solution, these optimal solutions not necessarily correspond to the optimal solution of the entire layered layout problem.
To overcome the problem we mentioned above, we propose a genetic algorithm to model the first three steps of the Sugiyama’s algorithm, in hope of simultaneously considering these three aesthetic criteria. Moreover, the designed genetic algorithm allows us to adjust the weight ratio of each criterion in order to satisfy human aesthetic viewpoints.
According to the result of our experiment, our genetic algorithm could effectively adjust the ratio between edge crossing number and total edge length. This algorithm could make layered layout more satisfy human aesthetic viewpoint.
en
dc.description.provenanceMade available in DSpace on 2021-06-15T01:36:11Z (GMT). No. of bitstreams: 1
ntu-98-R96921076-1.pdf: 1400016 bytes, checksum: 1764aaf0468cd90f317beeb82ed38cef (MD5)
Previous issue date: 2009
en
dc.description.tableofcontents致謝 i
中文摘要 ii
Abstract iii
LIST OF FIGURES vii
LIST OF TABLES ix
LIST OF ALGORITHMS x
Chapter 1 Introduction 1
Chapter 2 Preliminaries 7
2.1 Basic Definitions 7
2.2 Sugiyama’s Algorithm 9
2.2.1 Cycle Removal 9
2.2.2 Layer Assignment 10
2.2.3 Crossings Reduction 10
2.2.4 X-coordinate Assignment 11
2.3 Cyclic Leveling of Directed Graphs 12
2.3.1 Preliminaries 12
2.3.2 Heuristic Algorithm 12
2.3.3 Distance Functions 14
2.3.4 Results 14
2.4 Barycenter Algorithm 15
2.5 Priority Layout Method 16
2.6 Genetic Algorithm 18
2.6.1 Basic Definition 19
2.6.2 Initialization 19
2.6.3 Selection 20
2.6.4 Crossover 20
2.6.5 Mutation 21
2.6.6 Termination 21
Chapter 3 Genetic Algorithm on Layered Layout of Cyclic Directed Graphs 23
3.1 Definition 24
3.2 Fitness Specialization 28
3.3 Initialization 28
3.4 Selection 29
3.5 Crossover 30
3.6 Mutation 35
3.7 Termination 36
3.8 Fine Tune 37
Chapter 4 Experimental Results 39
4.1 Experimental Environment 40
4.2 Unlimited Width of Layout 41
4.3 Limited Width of Layout 53
4.4 Summary 62
Chapter 5 Conclusions and Future Work 69
5.1 Conclusions 69
5.2 Future Work 71
References 73
dc.language.isoen
dc.subject有向圖zh_TW
dc.subject分層布置圖zh_TW
dc.subject圖形製圖zh_TW
dc.subject基因演算法zh_TW
dc.subjecthierarchical graphsen
dc.subjectgenetic algorithmen
dc.subjectdirected graphsen
dc.subjectgraph drawingen
dc.subjectmulti-level graphsen
dc.subjectlayered layouten
dc.title基因演算法於繪製有向分層布置圖之應用zh_TW
dc.titleLayered Layouts of Directed Graphs Using a Genetic Algorithmen
dc.typeThesis
dc.date.schoolyear97-2
dc.description.degree碩士
dc.contributor.oralexamcommittee郭斯彥(Sy-Yen Kuo),雷欽隆(Chin-Laung Lei),莊仁輝(Jen-Hui Chuang),黃秋煌(Chua-Huang Huang)
dc.subject.keyword分層布置圖,圖形製圖,基因演算法,有向圖,zh_TW
dc.subject.keywordlayered layout,hierarchical graphs,multi-level graphs,graph drawing,directed graphs,genetic algorithm,en
dc.relation.page74
dc.rights.note有償授權
dc.date.accepted2009-07-16
dc.contributor.author-college電機資訊學院zh_TW
dc.contributor.author-dept電機工程學研究所zh_TW
顯示於系所單位:電機工程學系

文件中的檔案:
檔案 大小格式 
ntu-98-1.pdf
  未授權公開取用
1.37 MBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved