Book Chapter10.1007/3-540-62495-3_50
Constrained Graph Layout
Weiqing He,Kim Marriott +1 more
- 18 Sep 1996
- pp 217-232
TL;DR: This work describes four implementations of layout modules which are based on the constrained graph layout model and shows that they are quite fast and give reasonable layout.
read more
Abstract: Most current graph layout technology does not lend itself to interactive applications such as animation or advanced user interfaces. We introduce the constrained graph layout model which is better suited for interactive applications. In this model, input to the layout module includes suggested positions for nodes and constraints over the node positions in the graph to be laid out. We describe four implementations of layout modules which are based on the constrained graph layout model. The first three implementations are for undirected graph layout while the fourth is for tree layout. The implementations use active set techniques to solve the layout. Our empirical evaluation shows that they are quite fast and give reasonable layout.
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
Improved Force-Directed Layouts
Emden R. Gansner,Stephen C. North +1 more
- 01 Aug 1998
TL;DR: This paper describes the application of two post-processing techniques that can be applied to any initial vertex layout to produce uncluttered layouts with non-point nodes.
Solving linear arithmetic constraints for user interface applications
Alan Borning,Kim Marriott,Peter J. Stuckey,Yi Xiao +3 more
- 01 Oct 1997
TL;DR: In this paper, the authors describe incremental algorithms based on the dual simplex and active set methods that can solve linear equality and inequality constraints efficiently in user interfaces, such as requiring that onewindowbe to the left of another, requiring that a pane occupy the leftmost 1/3 of a window, or preferring that an object be contained within a rectangle if possible.
Revisiting Stress Majorization as a Unified Framework for Interactive Constrained Graph Visualization
Yunhai Wang,Yanyan Wang,Yinqi Sun,Lifeng Zhu,Kecheng Lu,Chi-Wing Fu,Michael Sedlmair,Oliver Deussen,Baoquan Chen +8 more
TL;DR: An improved stress majorization method that incorporates various constraints, including directional constraints without the necessity of solving a constraint optimization problem is presented, which allows the constraint-based exploration of large graphs with 10K nodes — an approach which previous methods cannot support.
72
Constrained Graph Layout
Weiqing He,Kim Marriott +1 more
TL;DR: This work describes four implementations of layout modules which are based on the constrained graph layout model and shows that they are quite fast and give reasonable layout.
66
•Journal Article
A tableau based constraint solving toolkit for interactive graphical applications
TL;DR: An object-oriented constraint solving toolkit, QOCA, designed for interactive graphical applications that provides three solvers, all of which rely on keeping the constraints in solved form and relies on novel algorithms for efficient resolving of constraints during direct manipulation.
43
References
•Book
Practical Methods of Optimization
Roger Fletcher
- 01 Jan 2009
TL;DR: The aim of this book is to provide a Discussion of Constrained Optimization and its Applications to Linear Programming and Other Optimization Problems.
9.3K
Graph drawing by force-directed placement
TL;DR: A modification of the spring‐embedder model of Eades for drawing undirected graphs with straight edges is presented, developed in analogy to forces in natural systems, for a simple, elegant, conceptually‐intuitive, and efficient algorithm.
Methods for Visual Understanding of Hierarchical System Structures
Kozo Sugiyama,Shojiro Tagawa,Mitsuhiko Toda +2 more
- 01 Feb 1981
TL;DR: 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.
1.4K