Results 11  20
of
104
An Algorithm For Drawing A Hierarchical Graph
, 1995
"... this paper we present a method for drawing "hierarchical directed graphs", which are digraphs in which each node is assigned a layer, as in Figure 1. ..."
Abstract

Cited by 18 (7 self)
 Add to MetaCart
this paper we present a method for drawing "hierarchical directed graphs", which are digraphs in which each node is assigned a layer, as in Figure 1.
GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D
 Proceedings of Graph Drawing ’96), Lecture Notes in Computer Science 1190
, 1997
"... Hierarchical structures represented by directed acyclic graphs are widely used in visualization applications (e.g., class inheritance diagrams and scheduling diagrams). 3D information visualization has received increasing attention in the last few years, motivated by the advances in hardware and ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
Hierarchical structures represented by directed acyclic graphs are widely used in visualization applications (e.g., class inheritance diagrams and scheduling diagrams). 3D information visualization has received increasing attention in the last few years, motivated by the advances in hardware and software technology for 3D computer graphics.
Inserting an Edge Into a Planar Graph
 Algorithmica
, 2000
"... Computing a crossing minimum drawing of a given planar graph G augmented by an additional edge e in which all crossings involve e, has been a long standing open problem in graph drawing. Alternatively, the problem can be stated as finding a planar combinatorial embedding of a planar graph G in which ..."
Abstract

Cited by 18 (9 self)
 Add to MetaCart
Computing a crossing minimum drawing of a given planar graph G augmented by an additional edge e in which all crossings involve e, has been a long standing open problem in graph drawing. Alternatively, the problem can be stated as finding a planar combinatorial embedding of a planar graph G in which the given edge e can be inserted with the minimum number of crossings. Many problems concerned with the optimization over the set of all combinatorial embeddings of a planar graph turned out to be NPhard. Surprisingly, we found a conceptually simple linear time algorithm based on SPQRtrees, which is able to find a crossing minimum solution.
A TopologyShapeMetrics Approach for the Automatic Layout of UML Class Diagrams
"... Class diagrams are among the most popular visualizations for object oriented software systems and have a broad range of applications. In many settings it is desirable that the placement of the diagram elements is determined automatically, especially when the diagrams are generated automatically whic ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
Class diagrams are among the most popular visualizations for object oriented software systems and have a broad range of applications. In many settings it is desirable that the placement of the diagram elements is determined automatically, especially when the diagrams are generated automatically which is usually the case in reverse engineering. For this reason the automatic layout of class diagram gained importance in the last years. Current approaches for the automatic layout of class diagrams are based on the hierarchic graph drawing paradigm. These algorithms produce good results for class diagrams with large and deep structural information, i.e., diagrams with a large and deep inheritance hierarchy. However, they do not perform satisfactorily in absence of this information. We propose in this work a new algorithm for automatic layout of class diagram which is based on the topologyshapemetrics approach. The algorithm is an adaption of sophisticated graph drawing algorithms which have proven their effectiveness in many applications. The algorithm works as well for class diagrams with rich structural information as for class diagrams with few or no structural information. It improves therefore the existing algorithms significantly. An implementation of the algorithm is used in the reverse engineering tool JarInspector.
SketchDriven Orthogonal Graph Drawing
, 2002
"... We present an orthogonal graph drawing algorithm that uses a sketchy drawing of the graph as input. While the algorithm produces an orthogonal drawing with few bends in the Kandinsky model it also preserves the general appearance of the sketch. Potential applications for this kind of drawing alg ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
We present an orthogonal graph drawing algorithm that uses a sketchy drawing of the graph as input. While the algorithm produces an orthogonal drawing with few bends in the Kandinsky model it also preserves the general appearance of the sketch. Potential applications for this kind of drawing algorithm include the generation of schematic maps from geographic networks and interactive orthogonal graph drawing.
Algorithms for AreaEfficient Orthogonal Drawings
 Computational Geometry: Theory and Applications
, 1996
"... An orthogonal drawing of a graph is a drawing such that nodes are placed on grid points and edges are drawn as sequences of vertical and horizontal segments. In this paper we present linear time algorithms that produce orthogonal drawings of graphs with n nodes. If the maximum degree is four, then t ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
An orthogonal drawing of a graph is a drawing such that nodes are placed on grid points and edges are drawn as sequences of vertical and horizontal segments. In this paper we present linear time algorithms that produce orthogonal drawings of graphs with n nodes. If the maximum degree is four, then the drawing produced by our first algorithm needs area at most (roughly) 0:76n 2 , and introduces at most 2n + 2 bends. Also, each edge of such a drawing has at most two bends. Our algorithm is based on forming and placing pairs of vertices of the graph. If the maximum degree is three, then the drawing produced by our second algorithm needs at most (roughly) 1 4 n 2 area and, if the graph is biconnected, at most b n 2 c + 3 bends. These upper bounds match the upper bounds known for planar graphs of maximum degree 3. This algorithm produces optimal drawings (within a constant of 2) with respect to the number of bends, since there is a lower bound of n 2 + 1 in the number of bends fo...
An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract)
, 1995
"... In this paper we present an extensive experimental study... ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
In this paper we present an extensive experimental study...
A mixedinteger program for drawing highquality metro maps
 IN PROC. 13TH INTERNATIONAL SYMPOSIUM ON GRAPH DRAWING
, 2006
"... In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g. the physical location of the tracks and stations of a metro system) and a set L of paths or cycles in G (e.g. metro lin ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g. the physical location of the tracks and stations of a metro system) and a set L of paths or cycles in G (e.g. metro lines), draw G and L nicely. We first specify the niceness of a drawing by listing a number of hard and soft constraints. Then we present a mixedinteger program (MIP) which always finds a drawing that fulfills all hard constraints (if such a drawing exists) and optimizes a weighted sum of costs corresponding to the soft constraints. We also describe some heuristics that speed up the MIP. We have implemented both the MIP and the heuristics. We compare their output to that of previous algorithms for drawing metro maps and to official metro maps drawn by graphic designers.
Comparing and Evaluating Layout Algorithms within GraphEd
 J. Visual Languages and Computing
, 1995
"... This paper is organized as follows. In section 2, we present an overview on the GraphEd system and the implemented graph drawing algorithms. Section 3 explains our evaluation experiments, and Section 4 shows our results. In Section 5 we give a subjective ranking of layout criteria. 2 GraphEd ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
This paper is organized as follows. In section 2, we present an overview on the GraphEd system and the implemented graph drawing algorithms. Section 3 explains our evaluation experiments, and Section 4 shows our results. In Section 5 we give a subjective ranking of layout criteria. 2 GraphEd
Constraints in graph drawing algorithms
 Constraints
, 1998
"... Abstract. Graphs are widely used for information visualization purposes, since they provide a natural and intuitive representation of complex abstract structures. The automatic generation of drawings of graphs has applications a variety of fields such as software engineering, database systems, and g ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Abstract. Graphs are widely used for information visualization purposes, since they provide a natural and intuitive representation of complex abstract structures. The automatic generation of drawings of graphs has applications a variety of fields such as software engineering, database systems, and graphical user interfaces. In this paper, we survey algorithmic techniques for graph drawing that support the expression and satisfaction of userdefined constraints. 1.