Drawing Graphs

@inproceedings{Leeuwen2001DrawingG,
  title={Drawing Graphs},
  author={Jan van Leeuwen and Michael Kaufmann and Dorothea Wagner and Jan van Leeuwen},
  booktitle={Lecture Notes in Computer Science},
  year={2001}
}

Figures and Tables from this paper

Crossing minimization in extended level drawings of graphs
TLDR
This paper first shows that the extended one-sided crossing minimization problem is NP-hard for both horizontal and radial drawings, and then presents efficient heuristics for minimizing edge crossings in extended level drawings. Expand
Circle planarity of level graphs
TLDR
The main results are linear time algorithms both for the planarity test and for the computation of an embedding, and thus a drawing, which use and generalise PQ-trees, which are a data structure for efficient planarity tests. Expand
Untangling graphs representing spatial relationships driven by drawing aesthetics
TLDR
This work addresses the problem of correcting misplaced edges of a given graph based on straight-line drawings in a plane and gives a polynomial-time algorithm that computes a modified graph with a better layout than the original graph when only single-edge replacements are allowed. Expand
Grid sifting: Leveling and crossing reduction
TLDR
A combined leveling and crossing reduction algorithm based on sifting, which prioritizes few crossings over few levels, which avoids type 2 conflicts, which are crossings of edges whose endpoints are dummy vertices. Expand
Visual Analysis of Controversy in User-generated Encyclopedias
  • U. Brandes, J. Lerner
  • Computer Science
  • 2007 IEEE Symposium on Visual Analytics Science and Technology
  • 2007
TLDR
It is shown that a visual analysis of the "who revises whom"- network gives deep insight into controversies, and a set of analysis and visualization techniques are proposed that reveal the dominant authors of a page, the roles they play, and the alters they confront. Expand
A Heuristic Approach Towards Drawings of Graphs With High Crossing Resolution
TLDR
The experimental evaluation indicates that the new heuristic produces drawings with better crossing resolution, but this comes at the cost of slightly higher edge-length ratio, especially when the input graph is large. Expand
BayeSuites: An open web framework for massive Bayesian networks focused on neuroscience
TLDR
The capabilities of the proposed framework are presented by highlighting a real example of a BN learned from genomic data obtained from Allen Institute for Brain Science, and the extensibility properties of the software are demonstrated with the help of the BN-based probabilistic clustering implementation. Expand
Data-driven graph drawing techniques with applications for conveyor systems
TLDR
From a mathematical point of view, the key idea is to use the concept of stress majorization to minimize a stress function over the positions of the nodes in the graph. Expand
On Turn-Regular Orthogonal Representations
TLDR
A linear-time testing algorithm for trees and a polynomial-time algorithm that tests whether a biconnected plane graph with "small" faces has a turn-regular orthogonal representation without bends are described. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 331 REFERENCES
Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms
TLDR
A framework for defining and validating metrics to measure the difference between two drawings of the same graph is introduced, and a preliminary experimental analysis of several simple metrics are given. Expand
A Near-Linear Area Bound for Drawing Binary Trees
TLDR
Several simple methods to construct planar, strictly upward, strongly order-preserving, straight-line drawings of any n -node binary tree are presented. Expand
A new approximation algorithm for the planar augmentation problem
TLDR
The outcome is surprising: the solution of the new algorithm is very often optimum and in almost all cases the solution found by the algorithm contains at most one more edge than in an optimum solution. Expand
Formal Concept Analysis: Mathematical Foundations
From the Publisher: This is the first textbook on formal concept analysis. It gives a systematic presentation of the mathematical foundations and their relation to applications in computer science,Expand
Orthogonal graph visualization: the three-phase method with applications
TLDR
The core idea is to break the problem of generating an orthogonal drawing into three phases: first placing the nodes as points, then approximately routing the edges, and finally converting nodes to boxes and assigning edges to ports at nodes. Expand
A Bayesian Paradigm for Dynamic Graph Layout
TLDR
Dynamic graph layout refers to the layout of graphs that change over time, which should adhere to constraints and criteria that have been specified to improve meaning and readability of a drawing. Expand
Online Animated Graph Drawing for Web Navigation
This paper describes an online animated graph drawing method. The method deals with huge graphs which are partially unknown. It is instantiated in OFDAV, a web diagram visualizer.
Algorithms for Drawing Graphs: an Annotated Bibliography
TLDR
A bibliographic survey on algorithms whose goal is to produce aesthetically pleasing drawings of graphs is presented, a first attempt to encompass both theoretical and application-oriented papers from disparate areas. Expand
Analysis of Algorithms for Drawing Graphs
  • PhD thesis, University of Queensland.
  • 1992
Rectilinear planar layouts of planar graphs and bipolar orientations
  • Discrete & Computational Geometry, 1(4):342–351.
  • 1986
...
1
2
3
4
5
...