[图书][B] Handbook of graph drawing and visualization
R Tamassia - 2013 - books.google.com
Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …
Drawing and labeling high-quality metro maps by mixed-integer programming
M Nollenburg, A Wolff - IEEE transactions on visualization and …, 2010 - ieeexplore.ieee.org
Metro maps are schematic diagrams of public transport networks that serve as visual aids for
route planning and navigation tasks. It is a challenging problem in network visualization to …
route planning and navigation tasks. It is a challenging problem in network visualization to …
Boundary labeling: Models and efficient algorithms for rectangular maps
We introduce boundary labeling, a new model for labeling point sites with large labels.
According to the boundary-labeling model, labels are placed around an axis-parallel …
According to the boundary-labeling model, labels are placed around an axis-parallel …
Drawing subway maps: A survey
A Wolff - Informatik-Forschung und Entwicklung, 2007 - Springer
This paper deals with automating the drawing of subway maps. There are two features of
schematic subway maps that make them different from drawings of other networks such as …
schematic subway maps that make them different from drawings of other networks such as …
A mixed-integer program for drawing high-quality metro maps
M Nöllenburg, A Wolff - International Symposium on Graph Drawing, 2005 - Springer
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 (eg …
Given a planar graph G of maximum degree 8 with its embedding and vertex locations (eg …
[图书][B] Automated drawing of metro maps
M Nöllenburg - 2005 - Citeseer
This diploma thesis investigates 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 …
follows. Given a planar graph G of maximum degree 8 with its embedding and vertex …
Boundary labeling: Models and efficient algorithms for rectangular maps
In this paper, we present boundary labeling, a new approach for labeling point sets with
large labels. We first place disjoint labels around an axis-parallel rectangle that contains the …
large labels. We first place disjoint labels around an axis-parallel rectangle that contains the …
[图书][B] 10 reasons to get interested in graph drawing
This is an invitation to the research area of graph drawing. It encompasses basic research
such as graph theory, complexity theory, data structures, and graph algorithms as well as …
such as graph theory, complexity theory, data structures, and graph algorithms as well as …
Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings
We present a simple and versatile formulation of grid-based graph representation problems
as an integer linear program (ILP) and a corresponding SAT instance. In a grid-based …
as an integer linear program (ILP) and a corresponding SAT instance. In a grid-based …
DAGView: an approach for visualizing large graphs
EM Kornaropoulos, IG Tollis - International Symposium on Graph Drawing, 2012 - Springer
In this paper, we propose a novel visualization framework called DAGView. The aim of
DAGView is to produce clear visualizations of directed acyclic graphs in which every edge …
DAGView is to produce clear visualizations of directed acyclic graphs in which every edge …