MapSets: Visualizing embedded and clustered graphs

Alon Efrat, Yifan Hu, Stephen G Kobourov, Sergey Pupyrev

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In addition to objects and relationships between them, groups or clusters of objects are an essential part of many real-world datasets: party affiliation in political networks, types of living organisms in the tree of life, movie genres in the internet movie database. In recent visualization methods, such group information is conveyed by explicit regions that enclose related elements. However, when in addition to fixed cluster membership, the input elements also have fixed positions in space (e.g., geo-referenced data), it becomes difficult to produce readable visualizations. In such fixed-clustering and fixed-embedding settings, some methods produce fragmented regions, while other produce contiguous (connected) regions that may contain overlaps even if the input clusters are disjoint. Both fragmented regions and unnecessary overlaps have a detrimental effect on the interpretation of the drawing. With this in mind, we propose MapSets: a visualization technique that combines the advantages of both methods, producing maps with non-fragmented and non-overlapping regions. The proposed method relies on a theoretically sound geometric algorithm which guarantees contiguity and disjointness of the regions, and also optimizes the convexity of the regions. A fully functional implementation is available in an online system and is used in a comparison with related earlier methods.

Original languageEnglish (US)
Pages (from-to)571-593
Number of pages23
JournalJournal of Graph Algorithms and Applications
Volume19
Issue number2
DOIs
StatePublished - 2015

Fingerprint

Visualization
Drawing (graphics)
Graph in graph theory
Online systems
Overlap
Acoustic waves
Internet
Contiguity
Geometric Algorithms
Convexity
Disjoint
Optimise
Clustering
Object

ASJC Scopus subject areas

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

Cite this

MapSets : Visualizing embedded and clustered graphs. / Efrat, Alon; Hu, Yifan; Kobourov, Stephen G; Pupyrev, Sergey.

In: Journal of Graph Algorithms and Applications, Vol. 19, No. 2, 2015, p. 571-593.

Research output: Contribution to journalArticle

@article{a2a8b83928de4f83bab50ad558e7385a,
title = "MapSets: Visualizing embedded and clustered graphs",
abstract = "In addition to objects and relationships between them, groups or clusters of objects are an essential part of many real-world datasets: party affiliation in political networks, types of living organisms in the tree of life, movie genres in the internet movie database. In recent visualization methods, such group information is conveyed by explicit regions that enclose related elements. However, when in addition to fixed cluster membership, the input elements also have fixed positions in space (e.g., geo-referenced data), it becomes difficult to produce readable visualizations. In such fixed-clustering and fixed-embedding settings, some methods produce fragmented regions, while other produce contiguous (connected) regions that may contain overlaps even if the input clusters are disjoint. Both fragmented regions and unnecessary overlaps have a detrimental effect on the interpretation of the drawing. With this in mind, we propose MapSets: a visualization technique that combines the advantages of both methods, producing maps with non-fragmented and non-overlapping regions. The proposed method relies on a theoretically sound geometric algorithm which guarantees contiguity and disjointness of the regions, and also optimizes the convexity of the regions. A fully functional implementation is available in an online system and is used in a comparison with related earlier methods.",
author = "Alon Efrat and Yifan Hu and Kobourov, {Stephen G} and Sergey Pupyrev",
year = "2015",
doi = "10.7155/jgaa.00364",
language = "English (US)",
volume = "19",
pages = "571--593",
journal = "Journal of Graph Algorithms and Applications",
issn = "1526-1719",
publisher = "Brown University",
number = "2",

}

TY - JOUR

T1 - MapSets

T2 - Visualizing embedded and clustered graphs

AU - Efrat, Alon

AU - Hu, Yifan

AU - Kobourov, Stephen G

AU - Pupyrev, Sergey

PY - 2015

Y1 - 2015

N2 - In addition to objects and relationships between them, groups or clusters of objects are an essential part of many real-world datasets: party affiliation in political networks, types of living organisms in the tree of life, movie genres in the internet movie database. In recent visualization methods, such group information is conveyed by explicit regions that enclose related elements. However, when in addition to fixed cluster membership, the input elements also have fixed positions in space (e.g., geo-referenced data), it becomes difficult to produce readable visualizations. In such fixed-clustering and fixed-embedding settings, some methods produce fragmented regions, while other produce contiguous (connected) regions that may contain overlaps even if the input clusters are disjoint. Both fragmented regions and unnecessary overlaps have a detrimental effect on the interpretation of the drawing. With this in mind, we propose MapSets: a visualization technique that combines the advantages of both methods, producing maps with non-fragmented and non-overlapping regions. The proposed method relies on a theoretically sound geometric algorithm which guarantees contiguity and disjointness of the regions, and also optimizes the convexity of the regions. A fully functional implementation is available in an online system and is used in a comparison with related earlier methods.

AB - In addition to objects and relationships between them, groups or clusters of objects are an essential part of many real-world datasets: party affiliation in political networks, types of living organisms in the tree of life, movie genres in the internet movie database. In recent visualization methods, such group information is conveyed by explicit regions that enclose related elements. However, when in addition to fixed cluster membership, the input elements also have fixed positions in space (e.g., geo-referenced data), it becomes difficult to produce readable visualizations. In such fixed-clustering and fixed-embedding settings, some methods produce fragmented regions, while other produce contiguous (connected) regions that may contain overlaps even if the input clusters are disjoint. Both fragmented regions and unnecessary overlaps have a detrimental effect on the interpretation of the drawing. With this in mind, we propose MapSets: a visualization technique that combines the advantages of both methods, producing maps with non-fragmented and non-overlapping regions. The proposed method relies on a theoretically sound geometric algorithm which guarantees contiguity and disjointness of the regions, and also optimizes the convexity of the regions. A fully functional implementation is available in an online system and is used in a comparison with related earlier methods.

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

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

U2 - 10.7155/jgaa.00364

DO - 10.7155/jgaa.00364

M3 - Article

AN - SCOPUS:84959514665

VL - 19

SP - 571

EP - 593

JO - Journal of Graph Algorithms and Applications

JF - Journal of Graph Algorithms and Applications

SN - 1526-1719

IS - 2

ER -