MapSets: Visualizing embedded and clustered graphs

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

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

We describe MapSets, a method for visualizing embedded and clustered graphs. The proposed method relies on a theoretically sound geometric algorithm, which guarantees the contiguity and disjointness of the regions representing the clusters, and also optimizes the convexity of the regions. A fully functional implementation is available online and is used in a comparison with related earlier methods.

Original languageEnglish (US)
Pages (from-to)452-463
Number of pages12
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8871
StatePublished - 2014

Fingerprint

Acoustic waves
Graph in graph theory
Contiguity
Geometric Algorithms
Convexity
Optimise
Sound

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

@article{8be7826df06442fea7eabd52a9a1165d,
title = "MapSets: Visualizing embedded and clustered graphs",
abstract = "We describe MapSets, a method for visualizing embedded and clustered graphs. The proposed method relies on a theoretically sound geometric algorithm, which guarantees the contiguity and disjointness of the regions representing the clusters, and also optimizes the convexity of the regions. A fully functional implementation is available online and is used in a comparison with related earlier methods.",
author = "Alon Efrat and Yifan Hu and Kobourov, {Stephen G} and Sergey Pupyrev",
year = "2014",
language = "English (US)",
volume = "8871",
pages = "452--463",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - MapSets

T2 - Visualizing embedded and clustered graphs

AU - Efrat, Alon

AU - Hu, Yifan

AU - Kobourov, Stephen G

AU - Pupyrev, Sergey

PY - 2014

Y1 - 2014

N2 - We describe MapSets, a method for visualizing embedded and clustered graphs. The proposed method relies on a theoretically sound geometric algorithm, which guarantees the contiguity and disjointness of the regions representing the clusters, and also optimizes the convexity of the regions. A fully functional implementation is available online and is used in a comparison with related earlier methods.

AB - We describe MapSets, a method for visualizing embedded and clustered graphs. The proposed method relies on a theoretically sound geometric algorithm, which guarantees the contiguity and disjointness of the regions representing the clusters, and also optimizes the convexity of the regions. A fully functional implementation is available online and is used in a comparison with related earlier methods.

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

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

M3 - Article

AN - SCOPUS:84915818682

VL - 8871

SP - 452

EP - 463

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -