文章基本信息

标题：On Bend-Minimized Orthogonal Drawings of Planar 3-Graphs
本地全文：下载
作者：Yi-Jun Chang ; Hsu-Chun Yen
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2017
卷号：77
页码：29:1-29:15
DOI：10.4230/LIPIcs.SoCG.2017.29
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：An orthogonal drawing of a graph is a planar drawing where each edge is drawn as a sequence of horizontal and vertical line segments. Finding a bend-minimized orthogonal drawing of a planar graph of maximum degree 4 is NP-hard. The problem becomes tractable for planar graphs of maximum degree 3, and the fastest known algorithm takes O(n^5 log n) time. Whether a faster algorithm exists has been a long-standing open problem in graph drawing. In this paper we present an algorithm that takes only O~(n^{17/7}) time, which is a significant improvement over the previous state of the art.
关键词：Bend minimization; graph drawing; orthogonal drawing; planar graph