Fitting planar graphs on planar maps

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

Research output: Contribution to journalArticle

3 Citations (Scopus)

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

Fingerprint

Planar Maps
Planar graph
NP-hardness
Decision problem
Polygon
Intuitive
Visualization
Hardness
Generalise
Sufficient Conditions
Graph in graph theory

ASJC Scopus subject areas

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

Cite this

Fitting planar graphs on planar maps. / Alam, Md Jawaherul; Kaufmann, Michael; Kobourov, Stephen G; McHedlidze, Tamara.

In: Journal of Graph Algorithms and Applications, Vol. 19, No. 1, 01.08.2015, p. 413-440.

Research output: Contribution to journalArticle

Alam, Md Jawaherul ; Kaufmann, Michael ; Kobourov, Stephen G ; McHedlidze, Tamara. / Fitting planar graphs on planar maps. In: Journal of Graph Algorithms and Applications. 2015 ; Vol. 19, No. 1. pp. 413-440.
@article{3af07e840cf04556aba802f83195dc22,
title = "Fitting planar graphs on planar maps",
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.",
author = "Alam, {Md Jawaherul} and Michael Kaufmann and Kobourov, {Stephen G} and Tamara McHedlidze",
year = "2015",
month = "8",
day = "1",
doi = "10.7155/jgaa.00367",
language = "English (US)",
volume = "19",
pages = "413--440",
journal = "Journal of Graph Algorithms and Applications",
issn = "1526-1719",
publisher = "Brown University",
number = "1",

}

TY - JOUR

T1 - Fitting planar graphs on planar maps

AU - Alam, Md Jawaherul

AU - Kaufmann, Michael

AU - Kobourov, Stephen G

AU - McHedlidze, Tamara

PY - 2015/8/1

Y1 - 2015/8/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84951268083&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84951268083&partnerID=8YFLogxK

U2 - 10.7155/jgaa.00367

DO - 10.7155/jgaa.00367

M3 - Article

VL - 19

SP - 413

EP - 440

JO - Journal of Graph Algorithms and Applications

JF - Journal of Graph Algorithms and Applications

SN - 1526-1719

IS - 1

ER -