An algorithm for drawing general undirected graphs
Information Processing Letters
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Lisp and Symbolic Computation
Communications of the ACM
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Constraints in Graph Drawing Algorithms
Constraints
Fast Interactive 3-D Graph Visualization
GD '95 Proceedings of the Symposium on Graph Drawing
Graph Drawing by High-Dimensional Embedding
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
A high-dimensional approach to interactive graph visualization
Proceedings of the 2004 ACM symposium on Applied computing
An Interactive Large Graph Visualizer
SG '08 Proceedings of the 9th international symposium on Smart Graphics
Graph drawing by classical multidimensional scaling: new perspectives
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.01 |
Graph drawing is an information visualization technology for illustrating relations between objects. Interactive graph drawing is often important since it is difficult to statically lay out complex graphs. For the interactive drawing of general undirected graphs, we previously proposed the high-dimensional approach, which used static graph layouts in high-dimensional spaces to dynamically find two-dimensional layouts according to user interaction. Although the resulting interactive graph drawing method was fast, it imposed a limitation on the successive manipulation of dense parts of graphs. In this paper, we propose an extended method to tackle the limitation. Our new method enables multiple graph nodes to be controlled simultaneously in interactive graph drawing. For this purpose, we extend the underlying constraint programming mechanism by introducing the notion of soft constraints as well as by using additional constraints on multiple controlled nodes.