Node-Edge Diagram Layout for Displaying Hierarchies
نویسندگان
چکیده
This paper reports the layout generation approach used in a new technique for visualizing hierarchies which provides both focus and context visualization. The hierarchy is represented as a node-edge diagram separated in two connected sub-diagrams that show the node of interest and its context.
منابع مشابه
Visualizing MeSH Dataset using Radial Tree Layout
Many display layout techniques were developed for the visualization of hierarchical data set like Cone tree, Treemap, Hyperbolic tree etc. Here, we present a new focus + context (fisheye) technique for visualizing and manipulating large hierarchies. We use the well knows radial tree layout method, in which focused node is placed in center of display, and all other nodes are rendered on appropri...
متن کاملRouting Drawings in Diagram Displays
We are interested in the problem on how to lay out practical graphs where nodes vary in shape and size. Applying classical graph drawing algorithms to practical graphs may result in overlapping nodes and/or edge-node intersections. This is because such algorithms were often originally designed for abstract graphs where nodes take up little or no space. To make use of such algorithms for practic...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملSankey Arcs - Visualizing edge weights in path graphs
Arc diagrams allow exploring relations and their strength between sequential nodes. Previous solutions suffer from displaying all arcs at the center of a node, which can lead to visual obstruction. We present a new technique, which extends the arc diagram technique by laying out the weighted edges of a node adjacent to each other. The aim of our Sankey Arc technique is to improve clarity, to en...
متن کاملLabeled Radial Drawing of Data Structures
This paper describes a radial layout method for displaying B +-tree data structures. We present an algorithmic framework for computing the node positions that result in a planar drawing. Layout issues related to displaying the internal structure of the nodes are addressed. Each field value and associated pointer that comprises the internal structure of the node is considered a subnode. The draw...
متن کامل