Incremental layout in DynaDAG
Lecture notes in computer sciencePublished 1 January 1996
Stephen C. North
Citations135
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
DynaDAG is described, a new heuristic for incremental layout of directed acyclic graphs drawn as hierarchies, and its application in the DynaGraph system.
Abstract
Graph drawings are a basic component of user interfaces that display relationships between objects. Generating incrementally stable layouts is important for many applications. This paper describes DynaDAG, a new heuristic for incremental layout of directed acyclic graphs drawn as hierarchies, and its application in the DynaGraph system.
Keywords
Computer Science
IEEE Transactions on Systems Man and CyberneticsMethods for Visual Understanding of Hierarchical System Structures
1,234 Citations1981Kozo Sugiyama, Shojiro Tagawa +1 more
Two kinds of new methods are developed to obtain effective representations of hierarchies automatically: theoretical and heuristic methods that determine the positions of vertices in two steps to improve the readability of drawings.
Software Practice and ExperienceSoftware: Practice and Experience
1,222 Citations2006Frédéric Gervais, Benoît Fraikin
Computational GeometryAlgorithms for drawing graphs: an annotated bibliography
860 Citations1994Giuseppe Di Battista, Peter Eades +2 more
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.
IEEE Transactions on Software EngineeringA technique for drawing directed graphs
668 Citations1993Emden R. Gansner, E. Koutsofios +2 more
A four-pass algorithm for drawing directed graphs is presented, which creates good drawings and is fast.
IEEE Transactions on Software EngineeringThe C information abstraction system
278 Citations1990Y.-F. Chen, Michael Nishimoto +1 more
It is shown how several interesting software tasks can be performed by using the relational views, including generation of graphical views, subsystem extraction, program layering, dead code elimination and binding analysis.
Incremental planarity testing
134 Citations1989Giuseppe Di Battista, Roberto Tamassia
An efficient technique for incremental planarity testing that uses O(n) space and supports tests and insertion of vertices and edges in O(log n) time is presented.
Software Practice and ExperienceA browser for directed graphs
116 Citations1987Lawrence A. Rowe, Michael J. Davis +4 more
A general‐purpose browser for directed graphs is described, which provides operations to examine and edit graphs and to generate a layout for a graph automatically that minimizes edge crossings.
IEEE SoftwareDrawing dynamic trees
84 Citations1990S. Moen
A tree-drawing algorithm that addresses the weaknesses of current approaches to constructing graphical user interfaces is presented and allows one to draw trees with nodes of any polygonal shape compactly.
Using constraints to achieve stability in automatic graph layout algorithms
75 Citations1990K. F. Böhringer, Frances Newbery Paulisch
This paper shows how user-specified layout constraints may be easily added to many automatic graph layout algorithms and allows a continuum between manual and automatic layout by allowing the user to specify how stable the graph's layout should be.
IEEE Transactions on Systems Man and CyberneticsAutomating the layout of network diagrams with specified visual organization
59 Citations1994C. Kosak, Joe Marks +1 more
The authors present a notation for describing the visual organization of a network diagram and present two new heuristic algorithms for this version of the layout problem: one algorithm uses a rule-based strategy for computing a layout; the other is a massively parallel genetic algorithm.
SIAM Journal on ComputingDynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
58 Citations1995Robert Cohen, Giuseppe Di Battista +2 more
A model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing, is devised, and its applications are shown.
Lecture notes in computer scienceProvence: A process visualization and enactment environment
38 Citations1993Balachander Krishnamurthy, Naser S. Barghouti
Provence is presented, an architecture that inculcates criteria and realizes them by integrating existing software components and provides a dynamic visual representation of changes to process and data throughout the lifetime of a project.
An incremental approach to aesthetic graph layout
30 Citations2002K. Miriyala, S.W. Hornick +1 more
A practical algorithm and its implementation, which efficiently routes edges according to the criteria of no node overlap and (heuristically) minimum crossings, bends, and length of edges, are discussed.
Cluster busting in anchored graph drawing
30 Citations1992Kelly Lyons
The problem of visualizing distributed systems as an area in which graph layout algorithms are often required is identified and four algorithms for solving these problems are presented.
Layout heuristics for graphical representations of programs
7 Citations2002Panagiotis K. Linos, Václav Rajlich +1 more
The experimental results show that the insertion method produces significantly better layouts compared to the existing methods.