講演抄録/キーワード |
講演名 |
2017-05-13 10:00
Acute Constrains in Straight-Line Drawings of Planar Graphs ○Akane Seto・Aleksandar Shurbevski・Hiroshi Nagamochi(Kyoto Univ.) COMP2017-5 |
抄録 |
(和) |
Recent research on graph drawing focuses on Right-Angle-Crossing (RAC) drawings of 1-plane graphs, where each edge is drawn as a straight line and two crossing edges only intersect at right angles. We give a transformation from a restricted case of the RAC drawing problem to a problem of finding a straight-line drawing of a maximal plane graph where some angles are required to be acute. For a restricted version of the latter problem, we show necessary and sufficient conditions for such a drawing to exist, and design an $O(n^2)$-time algorithm that given an $n$-vertex plane graph produces a desired drawing of the graph or reports that none exists. |
(英) |
Recent research on graph drawing focuses on Right-Angle-Crossing (RAC) drawings of 1-plane graphs, where each edge is drawn as a straight line and two crossing edges only intersect at right angles. We give a transformation from a restricted case of the RAC drawing problem to a problem of finding a straight-line drawing of a maximal plane graph where some angles are required to be acute. For a restricted version of the latter problem, we show necessary and sufficient conditions for such a drawing to exist, and design an $O(n^2)$-time algorithm that given an $n$-vertex plane graph produces a desired drawing of the graph or reports that none exists. |
キーワード |
(和) |
/ / / / / / / |
(英) |
graph drawing / 1-planarity / right angle crossing / / / / / |
文献情報 |
信学技報, vol. 117, no. 28, COMP2017-5, pp. 31-38, 2017年5月. |
資料番号 |
COMP2017-5 |
発行日 |
2017-05-05 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
PDFダウンロード |
COMP2017-5 |