Orientation-Constrained Rectangular Layouts

We construct partitions of rectangles into smaller rectangles from an input consisting of a planar dual graph of the layout together with restrictions on the orientations of edges and junctions of the layout. Such an orientation-constrained layout, if it exists, may be constructed in polynomial time, and all orientation-constrained layouts may be listed in polynomial time per layout.Comment: To appear at Algorithms and Data Structures Symposium, Banff, Canada, August 2009. 12 pages, 5 figure

Interactive, Constraint-based Layout of Engineering Diagrams

Many engineering disciplines require visualisation of networks. Constrained graph layout is a powerful new approach to network layout that allows the user to impose a wide variety application-specific placement constraints—such as downwards pointing directed edges, alignment of nodes, cluster containment and non-overlapping nodes and clusters—on the layout. We have recently developed an efficient algorithm for topology-preserving constrained graph layout. This underpins two dynamic graph layout applications we have developed: a network diagram authoring tool, Dunnart, and a network diagram browser. In this paper we provide an overview of topology-preserving constrained graph layout and illustrate how Dunnart and the network diagram browser can be applied to engineering diagram authoring and visualisation

Anisotropic Radial Layout for Visualizing Centrality and Structure in Graphs

This paper presents a novel method for layout of undirected graphs, where nodes (vertices) are constrained to lie on a set of nested, simple, closed curves. Such a layout is useful to simultaneously display the structural centrality and vertex distance information for graphs in many domains, including social networks. Closed curves are a more general constraint than the previously proposed circles, and afford our method more flexibility to preserve vertex relationships compared to existing radial layout methods. The proposed approach modifies the multidimensional scaling (MDS) stress to include the estimation of a vertex depth or centrality field as well as a term that penalizes discord between structural centrality of vertices and their alignment with this carefully estimated field. We also propose a visualization strategy for the proposed layout and demonstrate its effectiveness using three social network datasets.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

Extending constrained hierarchical layout for drawing UML activity diagrams

Ankara : The Department of Computer Engineering and Institute Engineering and Science of Bilkent University, 2002.Thesis (Master's) -- Bilkent University, 2002.Includes bibliographical references leaves 48-51.While modeling an object-oriented software, a visual language called Unified Modeling Language (UML) may be used. UML is a language and notation for specification, construction, visualization, and documentation of models of software systems. It consists of a variety of diagrams including class diagrams and activity diagrams. Graph layout has become an important area of research in Computer Science for the last couple of decades. There is a wide range of applications for graph layout including data structures, databases, software engineering, VLSI technology, electrical engineering, production planning, chemistry, and biology. Diagrams are more effective means of expressing relational information and automatic graph layout makes them to be more comprehensible. In other words, with graph layout techniques, the readability and the comprehensibility of the graphs increases and the complexity is reduced. UML diagrams are no exception. In this thesis, we present graph layout algorithms for UML activity diagrams based on constrained hierarchical layout. We use an existing implementation of constrained hierarchical layout to draw UML activity diagrams. We analyze and present the results of these new layout algorithms.Yüksel, H MehmetM.S

Planarization With Fixed Subgraph Embedding

The visualization of metabolic networks using techniques of graph drawing has recently become an important research area. In order to ease the analysis of these networks, readable layouts are required in which certain known network components are easily recognizable. In general, the topology of the drawings produced by traditional graph drawing algorithms does not reflect the biologists' expert knowledge on particular substructures of the underlying network. To deal with this problem we present a constrained planarization method---an algorithm which computes a graph layout in the plane preserving the predefined shape for the specified substructures while minimizing the overall number of edge-crossings

Planarization With Fixed Subgraph Embedding

The visualization of metabolic networks using techniques of graph drawing has recently become an important research area. In order to ease the analysis of these networks, readable layouts are required in which certain known network components are easily recognizable. In general, the topology of the drawings produced by traditional graph drawing algorithms does not reflect the biologists' expert knowledge on particular substructures of the underlying network. To deal with this problem we present a constrained planarization method---an algorithm which computes a graph layout in the plane preserving the predefined shape for the specified substructures while minimizing the overall number of edge-crossings

Incremental Grid-like Layout Using Soft and Hard Constraints

We explore various techniques to incorporate grid-like layout conventions into a force-directed, constraint-based graph layout framework. In doing so we are able to provide high-quality layout---with predominantly axis-aligned edges---that is more flexible than previous grid-like layout methods and which can capture layout conventions in notations such as SBGN (Systems Biology Graphical Notation). Furthermore, the layout is easily able to respect user-defined constraints and adapt to interaction in online systems and diagram editors such as Dunnart.Comment: Accepted to Graph Drawing 201