Straight-line drawability of a planar graph plus an edge

Peter Eades, Seok Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung Hung Poon

Research output: Chapter in Book/Conference proceedingConference contributionpeer-review

7 Citations (Scopus)

Abstract

We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing. The characterization enables a linear-time testing algorithm to determine whether an almost-planar graph admits a straight-line drawing, and a linear-time drawing algorithm that constructs such a drawing, if it exists. We also show that some almost-planar graphs require exponential area for a straight-line drawing.

Original languageEnglish
Title of host publicationAlgorithms and Data Structures - 14th International Symposium, WADS 2015, Proceedings
EditorsFrank Dehne, Jorg-Rudiger Sack, Ulrike Stege
PublisherSpringer Verlag
Pages301-313
Number of pages13
ISBN (Print)9783319218397
DOIs
Publication statusPublished - 2015
Externally publishedYes
Event14th International Symposium on Algorithms and Data Structures, WADS 2015 - Victoria, Canada
Duration: 5 Aug 20157 Aug 2015

Publication series

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

Conference

Conference14th International Symposium on Algorithms and Data Structures, WADS 2015
Country/TerritoryCanada
CityVictoria
Period5/08/157/08/15

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Straight-line drawability of a planar graph plus an edge'. Together they form a unique fingerprint.

Cite this