How to Draw a Planarization

  • Thomas Bläsius
  • Marcel Radermacher
  • Ignaz Rutter
Conference paper

DOI: 10.1007/978-3-319-51963-0_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10139)
Cite this paper as:
Bläsius T., Radermacher M., Rutter I. (2017) How to Draw a Planarization. In: Steffen B., Baier C., van den Brand M., Eder J., Hinchey M., Margaria T. (eds) SOFSEM 2017: Theory and Practice of Computer Science. SOFSEM 2017. Lecture Notes in Computer Science, vol 10139. Springer, Cham

Abstract

We study the problem of computing straight-line drawings of non-planar graphs with few crossings. We assume that a crossing-minimization algorithm is applied first, yielding a planarization, i.e., a planar graph with a dummy vertex for each crossing, that fixes the topology of the resulting drawing. We present and evaluate two different approaches for drawing a planarization in such a way that the edges of the input graph are as straight as possible. The first approach is based on the planarity-preserving force-directed algorithm ImPrEd [18], the second approach, which we call Geometric Planarization Drawing, iteratively moves vertices to their locally optimal positions in the given initial drawing.

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Thomas Bläsius
    • 1
    • 2
  • Marcel Radermacher
    • 1
  • Ignaz Rutter
    • 1
  1. 1.Faculty of InformaticsKarlsruhe Institute of Technology (KIT)KarlsruheGermany
  2. 2.Research Group Algorithm EngineeringHasso Plattner InstitutePotsdamGermany

Personalised recommendations