Battista, G., Eades, P., Tamassia, R. and Tollis, I.G. Algorithms for drawing graphs: An annotated bibliography. Computational Geometry: Theory and Applications, 4 (5). 235-282.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Analysis (LSA) 1] has been widely used to induce semantics of textual documents [3] especially in content based information retrieval [2] and semantic similarity comparison [4] The technique is explained in section 3.2. To visualize similarity results, Force Directed Placement (FDP) algorithms [5] are frequently used. Kumar etc. implemented a 3D version of FDP [6] Huang etc. extended FDP in a system that uses a logical frame to present a subgraph of an entire graph and smoothly migrates from one frame to another [7] FDP is used in Pathfinder Network Scaling (PfNet) which is utilized ....

Battista, G., Eades, P., Tamassia, R., & Tollis, I.G. (1994) . Algorithms for Drawing Graphs: an Annotated Bibliography. Computational Geometry: Theory and Applications, 4 (5), pp. 235-282.

....this constraint 1 By graph we mean the node edge network diagrams widely used to visualize binary relations, and not arbitrary informational graphics. There is a considerable literature on graph drawing algorithms, but it primarily concerns noninteractive techniques for automatic graph layout [2, 3, 11, 12, 15]. 2 These VOFs have been incorporated previously in two batch systems for graph layout [4, 9] The present system is the first to allow interactive specification and manipulation of persistent high level VOFs such as these. In related work, Henry and Hudson have described an interactive ....

Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis Tollis. Algorithms for drawing graphs: an annotated bibliography. Computational Geometry: Theory and Applications, 4:235--282, 1994.

....drawn manually so that the resulting picture best shows the underlying relationships. The task of drawing graphs by hand becomes more challenging as the complexity of the graphs increases. Graph drawing tools have been the focus of the graph drawing community for at least the last two decades, see [9, 10, 23] for a comprehensive reviews of the field. Numerous algorithms have been developed for drawing special classes of graphs such as trees and planar graphs. There are fewer general purpose graph drawing algorithms, however. Force directed methods are the methods of choice for drawing general graphs. ....

G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Computational Geometry: Theory and Applications, 4:235--282, 1994.

....generally guarantee a bijective mapping. Graph Drawing: The field of graph drawing addresses the issue of bijective mappings more rigorously. Relevant topics include straight line drawings on a grid [Fraysseix et al. 1990] and convex straight line drawings [Chiba et al. 1985] Di Battista et al. [Di Battista et al. 1994] present a survey of the field. These techniques produce guaranteed bijective mappings, but the necessary grids for a graph with V vertices are worst case (and typically) O(V) width and height, and the vertices are generally unevenly spaced. To break a surface into polygonal patches, we currently ....

Di Battista, Giuseppe, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Algorithms for Drawing Graphs: An Annotated Bibliography. Computational Geometry Theory and Applications. vol. 4. 1994. pp. 235-282.

....layout of directed acyclic graphs drawn as hierarchies, and its application in the DynaGraph system. 1 Introduction Effective techniques have been developed for some important families of graph layouts, such as hierarchies, planar embeddings, orthogonal grids and forced directed (spring) models [1]. These techniques have been incorporated in practical user interfaces that display static diagrams of relationships between objects [19, 18, 17] Static diagrams are not completely satisfactory because in many situations, the displayed graphs can change. Three common scenarios are: Manual ....

G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis. Algorithms for drawing graphs: An annotated bibliography. Computation Geometry: Theory and Applications, 4(5):235--282, 1994. Available at ftp.cs.brown.edu in /pub/compgeo/gdbiblio.tex.Z.

....of a graph that satisfies a given aesthetic objective. The representation of a graph is often given by an embedding of its nodes in a target grid. This problem has many practical applications in many fields such as Software Engineering, and VLSI Design. An extended survey on this topic is [Battista et al. 1994]. Some papers have explored the suitability of EA in Graph Drawing problems. Some good examples can be found in [Kosak et al. 1991; Branke et al. 1997; Rosete Surez and OchoaRodr guez, 1998, Tettamanzi 1998] Our results demonstrate that Stochastic Hill Climbing is also the best algorithm in this ....

....satisfies a given aesthetic objective. The representation of a graph is often given by an embedding of its nodes in a target grid. This problem has many practical applications in many fields such as Software Engineering, VLSI Design and plant layout. An extended survey on this topic appears in [Battista et al. 1994]. Some papers have explored the suitability of EA in Graph Drawing problems. Some good examples can be found in [Kosak et al. 1991; Branke et al. 1997; Rosete Surez and Ochoa Rodrguez, 1998, Tettamanzi 1998] Examples of the aesthetic criteria that the objective function takes into account are ....

[Article contains additional citation context not shown here]

Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Algorithms for drawing graphs: an annotated bibliography, Discrete Geometry: Theory and Applications, 4:235-282,1994.

....data that usually has some concrete physical interpretation (e.g. weather maps, three dimensional models of wings, flow problems) relational data is by contrast relatively abstract. Two common techniques for depicting relational data are scatterplots [9, 21] and node and link diagrams (graphs) [28, 58]. While scatterplots can be used to visualize n attributes of a single relation, graphs are capable of depicting one or more relationships among the tuples of a relation. It is easy to see that graphs subsume scatterplots scatterplots can be viewed merely as graphs that do not contain any ....

....tuples of a relation. It is easy to see that graphs subsume scatterplots scatterplots can be viewed merely as graphs that do not contain any links. Unlike scatterplots which are relatively straight forward to construct, however, automatic graph drawing remains a very challenging research area [28]. 1.1 Graph Visualization One aspect of graph drawing that has been receiving increasing attention is the scaling problem: as graphs grow larger, it becomes more expensive to draw them (due to computational complexity of graph layout algorithms) and more difficult to understand the resulting ....

[Article contains additional citation context not shown here]

G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., to appear. Preprint avail. by anon. ftp from ftp.cs.brown.edu:pub/papers/compgeo/.

.... of horizontal and vertical segments, are widely used in applications such as data base systems (E R diagrams) software engineering (data flow diagrams) and circuit design (circuit schematics) An extensive survey on the different graph drawing standards and relative algorithms can be found in [4]. Most graph drawing algorithms are designed to work in a fixed embedding setting: they receive as input a graph G with information about its topology and produce as output a drawing of G that preserves such information. For a planar graph, such topological information is typically represented by ....

G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235--282, 1994.

....the given digraph can be found in time O(n b) where b is the number of bends, with a technique similar to the one presented in [3] to saturate the faces of an upward planar embedding. The enclosing planar st digraph can be drawn with any of techniques for drawing planar st digraphs (see [5]) and, eventually, the bends are smoothed. Fig. 4. A quasi upward planar drawing An example of drawing constructed with the algorithm presented in this section is shown in Fig. 4. 4 Lower Bounds on the Number of Bends of Quasi Upward Planar Drawings Let G = V; E) be a biconnected bimodal ....

....may be inserted. During the second step a shape is found with the minimum number of bends (within the given topology) in terms of an intermediate representation of the drawing. During the last step the final drawing is constructed by using any of the technique for drawing planar st digraphs (see [5]) and, eventually, the bends are smoothed. Further, for the applications for which to have a tidy drawing it is really important, even at the expense of a higher computation time, we have shown a branch and bound technique that minimizes the number of bends of each biconnected component by ....

G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235--282, 1994.

....future work. 5 Chapter 2 Background In this Chapter, we present the work related to this thesis in the area of forcedirected methods for graph layout and Java based [34] graph drawing software. The bibliography of the work done in the field of computer automated graph drawing can be found in [3] and [4] We start by stating the approach of a force directed method for graph drawing, and describe two types of force directed methods: the Spring and Electrical force based and Barycenter methods. We continue by introducing the various force directed algorithms for graph drawing. Then, we ....

G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: An annotated bibliography. Computational Geometry: Theory and Applications, 4:235--282, 1994.

....Four Color Theorem. When visualizing nonplanar graphs, a natural approach is to draw the graph in a way as close to planarity as possible (for example with as few edge crossings as possible) This is one of the problems of graph drawing, a field that has grown tremendously within the last decade [DETT94, DETT99] In any case there is great interest in the question of how far from being planar a given graph is. We survey ways of transforming a nonplanar graph into a planar graph and discuss measures for the nonplanarity of a graph. We concentrate on sequential algorithms for the o# line case, ....

....for solving problems on planar graphs, and how close other graphs are to planarity. The latter topic results in algorithms that transform a given graph into a planar graph. These results are briefly summarized in Section 4. 2 of the annotated graph drawing bibliography by Di Battista et al. DETT94] The book by Nishizeki and Chiba [NC88] is a thorough treatment of planar graphs, with an emphasis on algorithms. Nis90] can be seen as an update of [NC88] Johnson [Joh85] surveys the algorithmic complexity of problems on graphs, including problems on planar graphs. A graph G is said to be ....

[Article contains additional citation context not shown here]

Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Algorithms for Drawing Graphs: an Annotated Bibliography. Computational Geometry, 4:235--282, 1994.

....produce satisfying layouts for a fairly general class of graphs. Speed is also a criterion. We want our algorithms to lay out very large general weighted graphs, producing a straight edge layout that reflects the edge weightings and that places nodes close to other nodes to which they are similar. Di Battista, Eades, Tamassia, and Tollis (1994) gave four aesthetics that are important for the general graph case. Since our layout is straight edge, we trivially satisfy the aesthetic of avoiding bends in edges. Instead of keeping edge lengths uniform, we wish them to reflect the edge weights; our algorithms generally try to set the edge ....

....The tree layout algorithm was inspired by the cone tree 3 D visualization method for large hierarchies (Robertson, Mackinlay, and Card 1991) but avoids the occlusion problem induced by a 3 D visual system while still easily coping with the size graphs typically displayed in cone tree examples. Di Battista et al. 1994) gave other examples of radial layout algorithms of which this is an example. The tree layout algorithm is designed to work for (surprise) trees, but also works well for directed acyclic graphs (DAGs) and has proved to be useful for both general directed and undirected graphs. In the latter cases ....

[Article contains additional citation context not shown here]

Di Battista, G., Eades, P., Tamassia, R., and Tollis, I. (1994), "Algorithms For Drawing Graphs: An Annotated Bibliography," Computational Geometry, 4, 235--282.

....drawing is closely related to the box rectangular (BR ) drawing defined by Rahman, Nakano and Nishizeki [17] Our method can be adapted to provide a new simpler algorithm for solving the BR drawing problem. 1 Introduction The problem of nicely drawing a graph G has received increasing attention [5]. Typically, we want to draw the edges and the vertices of G on the plane so that certain aesthetic quality conditions and or optimization measures are met. Such drawings are very useful in visualizing planar graphs and find applications in fields such as computer graphics, VLSI layout, algorithm ....

G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235--282, 1994.

....drawn manually so that the resulting picture best shows the underlying relationships. The task of drawing graphs by hand becomes more challenging as the complexity of the graphs increases. Graph drawing tools have been the focus of the graph drawing community for at least the last two decades, see [9, 10, 23] for a comprehensive reviews of the eld. Numerous algorithms have been developed for drawing special classes of graphs such as trees and planar graphs. There are fewer general purpose graph drawing algorithms, however. Force directed methods are the methods of choice for drawing general graphs. ....

G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Computational Geometry: Theory and Applications, 4:235-282, 1994.

....in animated graph drawing by using a modi ed spring algorithm to provide smooth user transitions. Other related work includes: 19] 4] 14] 18] and [21] A preliminary version of our second proposal, including a proof, appeared in [10] For a comprehensive survey of graph drawing methods, see [3, 22]. Finally we mention some previous work [24, 25] on adapting the GENET model to solve constraint optimization problems [23] Guided Local Search (GLS) 25] iteratively calls a local search procedure, based on the GENET variable updating scheme, to modify and minimize an augmented cost function ....

G. Di. Battisa, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Computational Geometry: Theory and Applications, 4:235-282, 1994.

....measures on the algorithm s perfomance. 1 Introduction The graph drawing research has received increasing attention recently. Variuos graphic standards have been proposed to draw graphs, in order to fit specific application fields. An extensive literature on the subject can be found in [2]. Several libraries of data structures and algorithms supporting graph drawing have been developed, e.g. LEDA [11] Tom Sawyer Graph Layout Toolkit [16] and GraphBase [10] Many graph visualization and editing systems are also available, e.g. Diagram Server [3] daVinci [5] Graphlet [8] GIOTTO3D ....

G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235--282, 1994.

..... 11 i 1 Introduction Most work on graph drawing addresses the problem of layouting a single, static graph. Algorithms have been developed for di erent classes of graphs (trees, dags, digraphs, and di erent aesthetic criteria, like minimizing crossings and bends or maximizing symmetries [1, 6]. But the world is full of dynamic graphs, e.g. animations of graph algorithms or algorithms which work on pointered data structures, dynamic visualisations of resource allocation in operating systems and project management, network connectivity and the constantly changing hyperlink structure of ....

G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Computational Geometry: Theory and Applications, 4:235-282, 1994.

....a drawing of the same diagram using our algorithmic framework. A comprehensive approach to hierarchical drawings of directed graphs is described in Sugiyama et al. 35] Several extensions and variations of this approach have been introduced in the literature. A comprehensive survey is given in [1]. A first extension that takes into consideration cycles and dummy nodes for large edges (i.e. edges that span more that one level) was introduced by Rowe et al. 31] Gansner et al. 14, 15] provide a technique to draw directed graphs using a simplex based algorithm that assigns vertices to ....

G. D. Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., (4):235--282, 1994.

No context found.

G. Di Battista, P. Eades, R. Tamassia and I. Tollis, "Algorithms for Drawing Graphs: An Annotated Bibliography", Comp. Geom. Theory Appl.. 4 (1994) 235 -- 282.

....tools in numerous areas such as project management, software development, database design, and network management. We present our approach to the above problem as implemented in the Graph Layout Toolkit. Many graph layout and editing systems have been developed in the past. Please refer to [1] for an overview of such systems. One essential aspect that has not been addressed in any previous system, is the capability to support the automatic placement of labels related to the edges of a drawing. The Graph Layout Toolkit (GLT) 5, 6] is a family of graph layout libraries that facilitate ....

G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235--282, 1994.

....layout is simply misleading. Automatic graph layout has received a great deal of attention since last decade. Many aesthetics for modelling goodness of graph layouts have been proposed from various applications, as well as graph layout algorithms for achieving those proposed layout aesthetics [4, 13]. In this paper, we are interested only in graph layouts in two dimensional Euclidean space. Symmetry is one of the most important aesthetics for delivering an easily understandable graph layout. A graph with a symmetric structure requires us only to concentrate on its core part, while the other ....

....a display of graph symmetries has been shown NP complete in general, even restricted only to a single symmetry [15] the simultaneous display of a set of symmetries seems even harder. On the other hand, it has been demonstrated by numerous experiments that spring (or force directed) algorithms [4] can serve as very effective heuristics for displaying graph symmetries; for instance, the layout in Figure 1(a) is produced by the spring algorithm in [12] A spring algorithm takes a graph as input, simulates a system of springs defined on the graph, and outputs a locally minimum energy ....

[Article contains additional citation context not shown here]

G. Di Battista, P. Eades and R. Tamassia, Algorithms for drawing graphs: an annotated bibliography, Computational Geometry: Theory and Application, 4, 235-282, 1994.

....tool with animation that embodies the algorithm and allows interacting with all the phases of the computation. 1 Introduction Various graphic standards have been proposed to draw graphs, each one devoted to a specific class of applications. An extensive literature on the subject can be found in [4, 23, 2]. In particular, an orthogonal drawing maps each edge into a chain of horizontal and vertical segments and an orthogonal grid drawing is an orthogonal drawing such that vertices and bends along the edges have integer coordinates. Orthogonal grid drawings are widely used for graph visualization in ....

G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235--282, 1994.

No context found.

Battista, G., Eades, P., Tamassia, R. and Tollis, I.G. Algorithms for drawing graphs: An annotated bibliography. Computational Geometry: Theory and Applications, 4 (5). 235-282.

No context found.

G. D. Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Technical report, Brown University, June 1994.

No context found.

G. Di Battista, P. Eades, R. Tamassia, I. Tollis, "Algorithms for Drawing Graphs: an Annotated Bibliography", available via ftp from wilma.cs.brown (128.148.33.66) in file /pub/gdbiblio.tex.Z.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC