Results 1  10
of
40
An algorithm for drawing general undirected graphs
 Information Processing Letters
, 1989
"... Graphs (networks) are very common data structures which are handled in computers. Diagrams are widely used to represent the graph structures visually in many information systems. In order to automatically draw the diagrams which are, for example, state graphs, dataflow graphs, Petri nets, and entit ..."
Abstract

Cited by 690 (2 self)
 Add to MetaCart
(Show Context)
Graphs (networks) are very common data structures which are handled in computers. Diagrams are widely used to represent the graph structures visually in many information systems. In order to automatically draw the diagrams which are, for example, state graphs, dataflow graphs, Petri nets, and entityrelationship diagrams, basic graph drawing algorithms are required.
An Experimental Comparison of Four Graph Drawing Algorithms
, 1995
"... In this paper we present an extensive experimental study comparing four generalpurpose graph drawing algorithms. The four algorithms take as input general graphs (with no restrictions whatsoever on connectivity, planarity, etc.) and construct orthogonal grid drawings, which are widely used in so ..."
Abstract

Cited by 61 (8 self)
 Add to MetaCart
In this paper we present an extensive experimental study comparing four generalpurpose graph drawing algorithms. The four algorithms take as input general graphs (with no restrictions whatsoever on connectivity, planarity, etc.) and construct orthogonal grid drawings, which are widely used in software and database visualization applications. The test data (available by anonymous ftp) are 11,582 graphs, ranging from 10 to 100 vertices, which have been generated from a core set of 112 graphs used in "reallife" software engineering and database applications. The experiments
Confluent drawings: Visualizing NonPlanar Diagrams in a Planar Way
 GRAPH DRAWING (PROC. GD ’03), VOLUME 2912 OF LECTURE NOTES COMPUT. SCI
, 2003
"... We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing nonplanar graphs in a planar way. This approach allows us to draw, in a crossingfree manner, graphs—such as software interaction diagrams—that would normally have many cro ..."
Abstract

Cited by 53 (9 self)
 Add to MetaCart
We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing nonplanar graphs in a planar way. This approach allows us to draw, in a crossingfree manner, graphs—such as software interaction diagrams—that would normally have many crossings. The main idea of this approach is quite simple: we allow groups of edges to be merged together and drawn as “tracks” (similar to train tracks). Producing such confluent drawings automatically from a graph with many crossings is quite challenging, however, we offer a heuristic algorithm (one version for undirected graphs and one version for directed ones) to test if a nonplanar graph can be drawn efficiently in a confluent way. In addition, we identify several large classes of graphs that can be completely categorized as being either confluently drawable or confluently nondrawable.
Using Constraints To Achieve Stability In Automatic Graph Layout Algorithms
 IN PROCEEDINGS OF THE CHI  CONFERENCE ON HUMAN FACTORS IN COMPUTING SYSTEMS
, 1990
"... Automatic layout algorithms are commonly used when displaying graphs on the screen because they provide a "nice" drawing of the graph without user intervention. There are, however, a couple of disadvantages to automatic layout. Without user intervention, an automatic layout algorithm is on ..."
Abstract

Cited by 30 (0 self)
 Add to MetaCart
Automatic layout algorithms are commonly used when displaying graphs on the screen because they provide a "nice" drawing of the graph without user intervention. There are, however, a couple of disadvantages to automatic layout. Without user intervention, an automatic layout algorithm is only capable of producing an aesthetically pleasing drawing of the graph. User or applicationspecified layout constraints (often concerning the semantics of a graph) are difficult or impossible to specify. A second problem is that automatic layout algorithms seldom make use of information in the currentlayout when calculating the new layout. This can also be frustrating to the user because whenever a new layout is done, the user's orientation in the graph is lost. This paper suggests using layout constraints to solve both of these problems. We showhow userspeci#ed layout constraints may be easily added to many automatic graph layout algorithms. Additionally, the constraints specified by the current layou...
Algorithms for Drawing Clustered Graphs
, 1997
"... In the mid 1980s, graphics workstations became the main platforms for software and information engineers. Since then, visualization of relational information has become an essential element of software systems. Graphs are commonly used to model relational information. They are depicted on a graphics ..."
Abstract

Cited by 28 (2 self)
 Add to MetaCart
In the mid 1980s, graphics workstations became the main platforms for software and information engineers. Since then, visualization of relational information has become an essential element of software systems. Graphs are commonly used to model relational information. They are depicted on a graphics workstation as graph drawings. The usefulness of the relational model depends on whether the graph drawings effectively convey the relational information to the users. This thesis is concerned with finding good drawings of graphs. As the amount of information that we want to visualize becomes larger and the relations become more complex, the classical graph model tends to be inadequate. Many extended models use a node hierarchy to help cope with the complexity. This thesis introduces a new graph model called the clustered graph. The central theme of the thesis is an investigation of efficient algorithms to produce good drawings for clustered graphs. Although the criteria for judging the qua...
An Approach for Mixed Upward Planarization
 In Proc. 7th International Workshop on Algorithms and Data Structures (WADS’01
, 2003
"... In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization of the planarization problem for undirected graphs and is motivated by several applications in graph drawing. ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization of the planarization problem for undirected graphs and is motivated by several applications in graph drawing.
Information navigator: An information system using associative networks for display and retrieval
, 1992
"... Document retrieval is a highly interactive process dealing with large amounts of information. Visual representations can provide both a means for managing the complexity of large information structures and an interface style well suited to interactive manipulation. The system we have designed utiliz ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
(Show Context)
Document retrieval is a highly interactive process dealing with large amounts of information. Visual representations can provide both a means for managing the complexity of large information structures and an interface style well suited to interactive manipulation. The system we have designed utilizes visually displayed graphic structures and a direct manipulation interface style to supply an integrated environment for retrieval. A common visually displayed network structure is used for query, document content, and term relations. A query can be modified through direct manipulation of its visual form by incorporating terms from any other information structure the system displays. An associative thesaurus of terms and an interdocument network provide information about a document collection that can complement other retrieval aids. Visualization of these large data structures makes use of fisheye views and overview diagrams to help overcome some of the inherent difficulties of orientation and navigation in large information structures.
Drawing High Degree Graphs with Low Bend Numbers
 PROC. 4TH SYMPOSIUM ON GRAPH DRAWING (GD'95), LNCS 1027
, 1995
"... We consider the problem of drawing plane graphs with an arbitrarily high vertex degree orthogonally into the plane such that the number of bends on the edges should be minimized. It has been known how to achieve the bend minimum without any respect to the size of the vertices. Naturally, the vertice ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
We consider the problem of drawing plane graphs with an arbitrarily high vertex degree orthogonally into the plane such that the number of bends on the edges should be minimized. It has been known how to achieve the bend minimum without any respect to the size of the vertices. Naturally, the vertices should be represented by uniformly small squares. In addition we might require that each face should be represented by a nonempty region. This would allow a labeling of the faces. We present an efficient algorithm which provably achieves the bend minimum following these constraints. Omitting the latter requirement we conjecture that the problem becomes NPhard. For that case, we give advices for good approximations. We demonstrate the effectiveness of our approaches giving some interesting examples.