Fitting planar graphs on planar maps

Md Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov, Tamara McHedlidze

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

Graph and cartographic visualization have the common objective to provide intuitive understanding of some underlying data. We consider a problem that combines aspects of both by studying the problem of fitting planar graphs on planar maps. After providing an NP-hardness result for the general decision problem, we identify sufficient conditions so that a fit is possible on a map with rectangular regions. We generalize our techniques to non-convex rectilinear polygons, where we also address the problem of efficient distribution of the vertices inside the map regions.

Original languageEnglish (US)
Pages (from-to)413-440
Number of pages28
JournalJournal of Graph Algorithms and Applications
Volume19
Issue number1
DOIs
StatePublished - Aug 1 2015

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)
  • Computer Science Applications
  • Geometry and Topology
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Fitting planar graphs on planar maps'. Together they form a unique fingerprint.

  • Cite this