Journal Article10.1109/12.736444
Interactive orthogonal graph drawing
A. Papakostas,Ioannis G. Tollis +1 more
31
TL;DR: In this article, the authors discuss features that are essential for an interactive orthogonal graph drawing system, and describe some possible interactive drawing scenarios, present results on two of them, and compare their performance.
read more
Abstract: Many applications require human interaction during the design process. The user is given the ability to alter the graph as the design progresses. Interactive Graph Drawing allows the user to dynamically interact with the drawing of a graph. In this paper, we discuss features that are essential for an interactive orthogonal graph drawing system. We also describe some possible interactive drawing scenarios, present results on two of them, and compare their performance.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms
TL;DR: 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.
60
Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions
TL;DR: Two algorithms for orthogonal graph drawing in three dimensional space are presented that guarantee no crossings and can be used under an interactive setting (i.e., vertices arrive and enter the drawing on-line), as well.
A User Study in Similarity Measures for Graph Drawing
Stina S. Bridgeman,Roberto Tamassia +1 more
- 20 Sep 2000
TL;DR: This paper builds on the previous work by defining some additional similarity measures, refining some existing ones, and presenting the results of a user study designed to evaluate the suitability of the measures.
Efficient Orthogonal Drawings of High Degree Graphs
TL;DR: Two important properties of the algorithm are that the drawings exhibit a small total number of bends (less than m), and that there is at most one bend per edge.
41
Experimental studies on graph drawing algorithms
Luca Vismara,Giuseppe Di Battista,Ashim Garg,Giuseppe Liotta,Roberto Tamassia,Francesco Vargiu +5 more
TL;DR: The results of some of the most popular experimental studies on graph drawing algorithms are described, each of which presents an in‐depth comparative analysis on a specific class of algorithms, namely, algorithms for orthogonal drawings, interactive algorithms, algorithm for hierarchical drawings, and force‐directed and randomized algorithms.
References
•Book
Combinatorial Algorithms for Integrated Circuit Layout
Thomas Lengauer
- 07 Sep 1990
TL;DR: This paper will concern you to try reading combinatorial algorithms for integrated circuit layout as one of the reading material to finish quickly.
1.1K
Algorithms for drawing graphs: an annotated bibliography
TL;DR: 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.
1K
On embedding a graph in the grid with the minimum number of bends
TL;DR: An algorithm is presented that computes a region preserving grid embedding with the minimum number of bends in edges with use of network flow techniques, and runs in time $O(n^2 \log n)$, where n is the number of vertices of the graph.
663
Layout Adjustment and the Mental Map
TL;DR: This paper discusses some layout adjustment methods and the preservation of the 'mental map' of the diagram, and two kinds of layout adjustments are described, an algorithm for rearranging a diagram to avoid overlapping nodes and a method aimed at changing the focus of interest of the user without destroying the mental map.
662
Universality considerations in VLSI circuits
TL;DR: The problem of embedding the interconnection pattern of a circuit into a two-dimensional surface of minimal area is discussed and restricted classes of graphs have to be considered in order to achieve compact embeddings.
467