Papers
More filters
TL;DR: An algorithm for the layout of undirected compound graphs based on the traditional force-directed layout scheme with extensions to handle multi-level nesting, edges between nodes of arbitrary nesting levels, varying node sizes, and other possible application-specific constraints is presented.
85 citations
Patent•
22 Jun 2006TL;DR: In this paper, a system for arranging a plurality of nodes into graphical layout form partitions the nodes into a set of clusters from which a cluster graph is created, based on the inter-nodal relationships, and cluster size depends on the number of nodes associated with each cluster.
Abstract: A system for arranging a plurality of nodes into graphical layout form partitions the nodes into a set of clusters from which a cluster graph is created. The cluster partitioning is based on the inter-nodal relationships, and cluster size depends on the number of nodes associated with each cluster. The clusters are laid out to avoid overlap, and cluster boundaries, within which nodes in a cluster are constrained, are generated. Nodes of each cluster as classified as either internal or boundary nodes, with boundary nodes being projected outward towards the boundary of the cluster. As an optional step, connection edges between nodes are routed to avoid overlap.
65 citations
18 Sep 1996
TL;DR: The Circular Library is one of the four styles currently available with the Graph Layout Toolkit, and produces layouts that emphasize natural group structures inherent in a graph's topology, and is well suited for the layout of ring and star network topologies.
Abstract: The Graph Layout Toolkit is a family of portable, automated, graph layout libraries designed for integration into graphical user interface application programs The Circular Library is one of the four styles currently available with the Graph Layout Toolkit It produces layouts that emphasize natural group structures inherent in a graph's topology, and is well suited for the layout of ring and star network topologies It clusters (groups) the nodes of a graph by group IDs, by IP addresses, and by biconnectivity or node degree, and allows the user to specify a range for the size of each cluster The Library positions the nodes of a cluster on a radiating circle, and employs heuristics to reduce the crossings not only between edges incident to nodes of the same cluster but also between edges that connect different clusters
52 citations
TL;DR: This work gives a survey of layout heuristics for general directed and undirected graphs and presents the browsing facilities that help to manage large structured graphs.
47 citations
18 Sep 1997
TL;DR: The three-phase method is introduced, a generic technique to create high-degree orthogonal drawings that simplifies the description and implementation of orthogsonal graph drawing, and can be applied to global as well as interactive and incremental settings.
Abstract: In this paper, we study orthogonal graph drawings from a practical point of view. Most previously existing algorithms restricted the attention to graphs of maximum degree four. Here we study orthogonal drawing algorithms that work for any input graph, and discuss different models for such drawings. Then we introduce the three-phase method, a generic technique to create high-degree orthogonal drawings. This approach simplifies the description and implementation of orthogonal graph drawing, and can be applied to global as well as interactive and incremental settings.
42 citations
Authors
Showing all 28 results
| Name | H-index | Papers | Citations |
|---|---|---|---|
| Peter Eades | 48 | 210 | 11103 |
| Ugur Dogrusoz | 24 | 63 | 20844 |
| Konstantinos G. Kakoulis | 11 | 23 | 315 |
| Ulrich Fößmeier | 10 | 14 | 397 |
| Qing-Wen Feng | 8 | 8 | 914 |
| Georg Sander | 8 | 13 | 393 |
| Burkay Genç | 8 | 23 | 178 |
| Brendan Madden | 8 | 15 | 292 |
| Rainer Neumann | 8 | 21 | 241 |
| Arne Frick | 7 | 11 | 551 |
| Arne Frick | 3 | 5 | 42 |
| Erhan Giral | 3 | 4 | 177 |
| Patrick Madden | 2 | 2 | 70 |
| U. Dogrusoz | 1 | 1 | 12 |
| Wendy Feng | 1 | 3 | 1 |