License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2017.29
URN: urn:nbn:de:0030-drops-72080
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7208/
Go to the corresponding LIPIcs Volume Portal


Chang, Yi-Jun ; Yen, Hsu-Chun

On Bend-Minimized Orthogonal Drawings of Planar 3-Graphs

pdf-format:
LIPIcs-SoCG-2017-29.pdf (2 MB)


Abstract

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.

BibTeX - Entry

@InProceedings{chang_et_al:LIPIcs:2017:7208,
  author =	{Yi-Jun Chang and Hsu-Chun Yen},
  title =	{{On Bend-Minimized Orthogonal Drawings of Planar 3-Graphs}},
  booktitle =	{33rd International Symposium on Computational Geometry (SoCG 2017)},
  pages =	{29:1--29:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-038-5},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{77},
  editor =	{Boris Aronov and Matthew J. Katz},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7208},
  URN =		{urn:nbn:de:0030-drops-72080},
  doi =		{10.4230/LIPIcs.SoCG.2017.29},
  annote =	{Keywords: Bend minimization, graph drawing, orthogonal drawing, planar graph}
}

Keywords: Bend minimization, graph drawing, orthogonal drawing, planar graph
Seminar: 33rd International Symposium on Computational Geometry (SoCG 2017)
Issue Date: 2017
Date of publication: 08.06.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI