|
ヤマグチ カズアキ
Kazuaki Yamaguchi
山口 一章 所属 追手門学院大学 理工学部 情報工学科 職種 教授 |
|
| 言語種別 | 英語 |
| 発行・発表の年月 | 2003 |
| 形態種別 | 外国学会誌(その他) |
| 査読 | 査読あり |
| 標題 | Placement of vertex labels in a graph drawing |
| 執筆形態 | 共著・編著(代表編著を除く) |
| 掲載誌名 | Proc. 3rd Hungarian-Japanese Symp. On Discrete Mathematics and Its Applications |
| 巻・号・頁 | 69-78(10),pp.2774-2779 |
| 著者・共著者 | ABE Noboru,MASUDA Sumio,YAMAGUCHI Kazuaki |
| 概要 | Let G be an undirected graph and let Γ be its drawing on a plane. Each vertex in G has a label with a specified size. In this paper, we consider the problem of placing the maximum number of vertex labels in Γ in such a way that they do not overlap any vertices, edges or other labels. By refining several portions of the Kakoulis-Toliis algorithm for labeling graphical features, we present a heuristic algorithm for this problem. Experimental results show that our algorithm can place more labels than previous algorithms. |
| ISSN | 0916-8508 |