Polar coordinate drawing of planar graphs with good angular resolution

Christian A. Duncan, Stephen G. Kobourov

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

We present a novel way to draw planar graphs with good angular resolution. We introduce the polar coordinate representation and describe a family of algorithms which use polar representation. The main advantage of using a polar representation is that it allows us to exert independent control over grid size and bend positions. Polar coordinates allow us to specify different vertex resolution, bend-point resolution and edge separation. We first describe a standard (Cartesian) representation algorithm (CRA) which we then modify to obtain a polar representation algorithm (PRA). In both algorithms we are concerned with the following drawing criteria: angular resolution, bends per edge, vertex resolution, bend-point resolution, edge separation, and drawing area. The CRA algorithm achieves 1 bend per edge, unit vertex and bend resolution, √2/2 edge separation, 5n × 5n/2 drawing area and 1/2d(v) angular resolution, where d(v) is the degree of vertex v. The PRA algorithm has an improved angular resolution of φ/4d(v) 1 bend per edge, and unit vertex resolution. For the PRA algorithm, the bend-point resolution and edge separation are parameters that can be modified to achieve different types of drawings and drawing areas. In particular, for the same parameters as the CRA algorithm (unit bend-point resolution and √2/2 edge separation), the PRA algorithm creates a drawing of size 9n × 9n/2.

Original languageEnglish (US)
Title of host publicationGraph Drawing - 9th International Symposium, GD 2001, Revised Papers
EditorsPetra Mutzel, Michael Junger, Sebastian Leipert
PublisherSpringer-Verlag
Pages407-421
Number of pages15
ISBN (Print)3540433090, 9783540433095
DOIs
StatePublished - 2002
Event9th International Symposium on Graph Drawing, GD 2001 - Vienna, Austria
Duration: Sep 23 2001Sep 26 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2265 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other9th International Symposium on Graph Drawing, GD 2001
CountryAustria
CityVienna
Period9/23/019/26/01

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Polar coordinate drawing of planar graphs with good angular resolution'. Together they form a unique fingerprint.

  • Cite this

    Duncan, C. A., & Kobourov, S. G. (2002). Polar coordinate drawing of planar graphs with good angular resolution. In P. Mutzel, M. Junger, & S. Leipert (Eds.), Graph Drawing - 9th International Symposium, GD 2001, Revised Papers (pp. 407-421). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2265 LNCS). Springer-Verlag. https://doi.org/10.1007/3-540-45848-4_32