Low ply graph drawing

  • Emilio Di Giacomo
  • , Walter Didimo
  • , Seok Hee Hong
  • , Michael Kaufmann
  • , Stephen G. Kobourov
  • , Giuseppe Liotta
  • , Kazuo Misue
  • , Antonios Symvonis
  • , Hsu Chun Yen

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

Abstract

We consider the problem of characterizing graphs with low ply number and algorithms for creating layouts of graphs with low ply number. Informally, the ply number of a straight-line drawing of a graph is defined as the maximum number of overlapping disks, where each disk is associated with a vertex and has a radius that is half the length of the longest edge incident to that vertex. We show that internally triangulated biconnected planar graphs that admit a drawing with ply number 1 can be recognized in O(n log n) time, while the problem is in general NP-hard. We also show several classes of graphs that have 1-ply drawings. We then show that binary trees, stars, and caterpillars have 2-ply drawings, while general trees have (h+1)-ply drawings, where h is the height of the tree. Finally we discuss some generalizations of the notion of a ply number.

Original languageEnglish (US)
Title of host publicationIISA 2015 - 6th International Conference on Information, Intelligence, Systems and Applications
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781467393119
DOIs
StatePublished - Jan 20 2016
Event6th International Conference on Information, Intelligence, Systems and Applications, IISA 2015 - Corfu, Greece
Duration: Jul 6 2015Jul 8 2015

Publication series

NameIISA 2015 - 6th International Conference on Information, Intelligence, Systems and Applications

Other

Other6th International Conference on Information, Intelligence, Systems and Applications, IISA 2015
Country/TerritoryGreece
CityCorfu
Period7/6/157/8/15

ASJC Scopus subject areas

  • Computer Science Applications
  • Social Sciences (miscellaneous)
  • Artificial Intelligence
  • Information Systems

Fingerprint

Dive into the research topics of 'Low ply graph drawing'. Together they form a unique fingerprint.

Cite this