Veröffentlichung

Titel:

Drawing Trees and Triangulations with Few Geometric Primitives

AutorInnen:

Gregor Hültenschmidt
Philipp Kindermann
Wouter Meulemans
André Schulz

Kategorie:

Konferenzbandbeiträge

erschienen in:

Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'17), pp. 316-329

Abstract:

We define the visual complexity of a plane graph drawing to be the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g. you need only one line segment to draw two collinear edges of the same vertex). We show that trees can be drawn with 3n/4 straight-line segments on a polynomial grid, and with n/2 straight-line segments on a quasi-polynomial grid. We also study the problem of drawing maximal triangulations with circular arcs and provide an algorithm to draw such graphs using only (5n - 11)/3 arcs. This provides a significant improvement over the lower bound of 2n for line segments for a nontrivial graph class.

Download:

Springer

BibTeX-Eintrag:

@InProceedings{hkms-dttfg-wg17, author = {Gregor H{\"u}ltenschmidt and Philipp Kindermann and Wouter Meulemans and Andr{\'e} Schulz}, title = {Drawing Planar Graphs with Few Geometric Primitives}, booktitle = {Proc. 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'17)}, year = {2017}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, volume = {10520}, series = {LNCS}, pages = {316--329}, publisher = {Springer}, abstract = {We define the \emph{visual complexity} of a plane graph drawing to be the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g. you need only one line segment to draw two collinear edges of the same vertex). We show that trees can be drawn with $3n/4$ straight-line segments on a polynomial grid, and with $n/2$ straight-line segments on a quasi-polynomial grid. We also study the problem of drawing maximal triangulations with circular arcs and provide an algorithm to draw such graphs using only $(5n - 11)/3$ arcs. This provides a significant improvement over the lower bound of $2n$ for line segments for a nontrivial graph class.}, doi = {10.1007/978-3-319-68705-6_24}, }