Multilevel Visualization of Clustered Graphs. Eades, P. & Feng, Q. Lecture Notes in Computer Science, Volume 119:101-112, 1997. abstract bibtex Clustered graphs are graphs with recursive clustering structures over the vertices. This type of structure appears in many systems. Examples include CASE tools, management information systems, VLSI design tools, and reverse engineering systems. Existing layout algorithms represent the clustering structure as recursively nested regions in the plane. However, as the structure becomes more and more complex, two dimensional plane representations tend to be insufficient. In this paper, firstly, we describe some two dimensional plane drawing algorithms for clustered graphs; then we show how to extend two dimensional plane drawings to three dimensional multilevel drawings. We consider two conventions: straight-line convex drawings and orthogonal rectangular drawings; and we show some examples.
@article{
title = {Multilevel Visualization of Clustered Graphs},
type = {article},
year = {1997},
identifiers = {[object Object]},
pages = {101-112},
volume = {Volume 119},
id = {abb11b0b-454f-3bc6-be3d-3790106afb30},
created = {2015-06-12T18:04:11.000Z},
file_attached = {false},
profile_id = {079833ff-3971-3748-bc4d-0152344aee81},
group_id = {40705738-69ca-37c0-b0d3-ae8304c583da},
last_modified = {2015-08-05T02:56:14.000Z},
read = {false},
starred = {false},
authored = {false},
confirmed = {true},
hidden = {false},
citation_key = {Eades1997},
abstract = {Clustered graphs are graphs with recursive clustering structures over the vertices. This type of structure appears in many systems. Examples include CASE tools, management information systems, VLSI design tools, and reverse engineering systems. Existing layout algorithms represent the clustering structure as recursively nested regions in the plane. However, as the structure becomes more and more complex, two dimensional plane representations tend to be insufficient. In this paper, firstly, we describe some two dimensional plane drawing algorithms for clustered graphs; then we show how to extend two dimensional plane drawings to three dimensional multilevel drawings. We consider two conventions: straight-line convex drawings and orthogonal rectangular drawings; and we show some examples.},
bibtype = {article},
author = {Eades, Peter and Feng, Qing-wen},
journal = {Lecture Notes in Computer Science}
}
Downloads: 0
{"_id":"bbw3SfDqSBg97b8v7","bibbaseid":"eades-feng-multilevelvisualizationofclusteredgraphs-1997","downloads":0,"creationDate":"2015-09-20T23:53:18.571Z","title":"Multilevel Visualization of Clustered Graphs","author_short":["Eades, P.","Feng, Q."],"year":1997,"bibtype":"article","biburl":null,"bibdata":{"title":"Multilevel Visualization of Clustered Graphs","type":"article","year":"1997","identifiers":"[object Object]","pages":"101-112","volume":"Volume 119","id":"abb11b0b-454f-3bc6-be3d-3790106afb30","created":"2015-06-12T18:04:11.000Z","file_attached":false,"profile_id":"079833ff-3971-3748-bc4d-0152344aee81","group_id":"40705738-69ca-37c0-b0d3-ae8304c583da","last_modified":"2015-08-05T02:56:14.000Z","read":false,"starred":false,"authored":false,"confirmed":"true","hidden":false,"citation_key":"Eades1997","abstract":"Clustered graphs are graphs with recursive clustering structures over the vertices. This type of structure appears in many systems. Examples include CASE tools, management information systems, VLSI design tools, and reverse engineering systems. Existing layout algorithms represent the clustering structure as recursively nested regions in the plane. However, as the structure becomes more and more complex, two dimensional plane representations tend to be insufficient. In this paper, firstly, we describe some two dimensional plane drawing algorithms for clustered graphs; then we show how to extend two dimensional plane drawings to three dimensional multilevel drawings. We consider two conventions: straight-line convex drawings and orthogonal rectangular drawings; and we show some examples.","bibtype":"article","author":"Eades, Peter and Feng, Qing-wen","journal":"Lecture Notes in Computer Science","bibtex":"@article{\n title = {Multilevel Visualization of Clustered Graphs},\n type = {article},\n year = {1997},\n identifiers = {[object Object]},\n pages = {101-112},\n volume = {Volume 119},\n id = {abb11b0b-454f-3bc6-be3d-3790106afb30},\n created = {2015-06-12T18:04:11.000Z},\n file_attached = {false},\n profile_id = {079833ff-3971-3748-bc4d-0152344aee81},\n group_id = {40705738-69ca-37c0-b0d3-ae8304c583da},\n last_modified = {2015-08-05T02:56:14.000Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n citation_key = {Eades1997},\n abstract = {Clustered graphs are graphs with recursive clustering structures over the vertices. This type of structure appears in many systems. Examples include CASE tools, management information systems, VLSI design tools, and reverse engineering systems. Existing layout algorithms represent the clustering structure as recursively nested regions in the plane. However, as the structure becomes more and more complex, two dimensional plane representations tend to be insufficient. In this paper, firstly, we describe some two dimensional plane drawing algorithms for clustered graphs; then we show how to extend two dimensional plane drawings to three dimensional multilevel drawings. We consider two conventions: straight-line convex drawings and orthogonal rectangular drawings; and we show some examples.},\n bibtype = {article},\n author = {Eades, Peter and Feng, Qing-wen},\n journal = {Lecture Notes in Computer Science}\n}","author_short":["Eades, P.","Feng, Q."],"bibbaseid":"eades-feng-multilevelvisualizationofclusteredgraphs-1997","role":"author","urls":{},"downloads":0},"search_terms":["multilevel","visualization","clustered","graphs","eades","feng"],"keywords":[],"authorIDs":[]}