Geodesic
MapSets: Visualizing Embedded and Clustered Graphs
Journal of Graph Algorithms and Applications, Special Issue on Selected Papers from the Twenty-second International Symposium on Graph Drawing, GD 2014 , Tome 19 (2015) no. 2, pp. 571-593.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

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.
DOI : 10.7155/jgaa.00364
Keywords: map-like visualization, set visualization, embedded graph, clustered graph, planar Steiner forest 
@article{JGAA_2015_19_2_a1,
     author = {Alon Efrat and Yifan Hu and Stephen Kobourov and Sergey Pupyrev},
     title = {MapSets: {Visualizing} {Embedded} and {Clustered} {Graphs}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {571--593},
     publisher = {mathdoc},
     volume = {19},
     number = {2},
     year = {2015},
     doi = {10.7155/jgaa.00364},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00364/}
}
TY  - JOUR
AU  - Alon Efrat
AU  - Yifan Hu
AU  - Stephen Kobourov
AU  - Sergey Pupyrev
TI  - MapSets: Visualizing Embedded and Clustered Graphs
JO  - Journal of Graph Algorithms and Applications
PY  - 2015
SP  - 571
EP  - 593
VL  - 19
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00364/
DO  - 10.7155/jgaa.00364
LA  - en
ID  - JGAA_2015_19_2_a1
ER  - 
%0 Journal Article
%A Alon Efrat
%A Yifan Hu
%A Stephen Kobourov
%A Sergey Pupyrev
%T MapSets: Visualizing Embedded and Clustered Graphs
%J Journal of Graph Algorithms and Applications
%D 2015
%P 571-593
%V 19
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00364/
%R 10.7155/jgaa.00364
%G en
%F JGAA_2015_19_2_a1
Alon Efrat; Yifan Hu; Stephen Kobourov; Sergey Pupyrev. MapSets: Visualizing Embedded and Clustered Graphs. Journal of Graph Algorithms and Applications, 
							Special Issue on Selected Papers from the Twenty-second International Symposium on Graph Drawing, GD 2014
					, Tome 19 (2015) no. 2, pp. 571-593. doi : 10.7155/jgaa.00364. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00364/

Cité par Sources :