An Algorithm for Placing Edge Labels in a Graph Drawing

スポンサーリンク

概要

• 論文の詳細を見る

• Let G be a graph and Γ be its drawing on a plane. Each edge in G has a label of specified size. We consider the problem of placing edge labels in Γ in such a way that no label overlaps vertices, edges or other labels. Recently, Kakoulis and Tollis proposed a heuristic algorithm for this problem. In this paper, we improve their algorithm by refining the part for deciding the candidates of label positions and that for choosing the final label positions. Experimental results show that our algorithm can place more labels than the original one.

• 社団法人電子情報通信学会の論文
• 2002-03-01

著者

• Abe N

  Graduate School Of Science And Technology Kobe University

• Masuda Sumio

  Faculty Of Engineering Kobe University

• Masuda S

  Department Of Electrical And Electronics Engineering Kobe University

• ABE Noboru

  Graduate School of Science and Technology, Kobe University

• YAMAGUCHI Kazuaki

  Department of Electrical and Electronics Engineering, Kobe University

• YAMAGUCHI Kazuaki

  Faculty of Engineering, Kobe University

• Yamaguchi Kazuaki

  Department Of Electrical And Electronics Engineering Kobe University

関連論文

• The Distances between Unrooted and Cyclically Ordered Trees and Their Computing Methods
• A Metric between Unrooted and Unordered Trees and Its Top-down Computing Method
• Bacterial characteristics within biofilms under low oxygen partial pressure
• Placement of Vertex Labels in a Graph Drawing(Graphs and Networks)
• An Algorithm for Drawing Undirected Graphs with Edge Labels
• An Algorithm for Placing Edge Labels in a Graph Drawing
• The adsorption and desorption of nitrogen oxide by the aqueous dispersion of the chelate resin-immobilized iron(II) complex.

スポンサーリンク