Results 1 
4 of
4
Three Dimensional UML using Force Directed Layout
, 2001
"... The Unified Modelling Language (UML) is a visual language for modelling software designs and is currently the most widely accepted standard for software diagrams in the software engineering field. Force Directed Layout algorithms are methods for arranging the elements of a graph in an aesthetically ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
The Unified Modelling Language (UML) is a visual language for modelling software designs and is currently the most widely accepted standard for software diagrams in the software engineering field. Force Directed Layout algorithms are methods for arranging the elements of a graph in an aesthetically pleasing and clear manner.
PROVEDA: A scheme for Progressive Visualization and Exploratory Data Analysis of clusters.
 In Proceedings of 3rd Software Visualization Workshop
, 1999
"... This paper presents a scaleoriented scheme for data visualization. The aim is to explore and validate the hypothesis, that a high quality visual layout exhibits a good quality hierarchical data clustering.In this scheme, the information to be visualized and clustered is represented as a graph, wher ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
This paper presents a scaleoriented scheme for data visualization. The aim is to explore and validate the hypothesis, that a high quality visual layout exhibits a good quality hierarchical data clustering.In this scheme, the information to be visualized and clustered is represented as a graph, where the nodes represent pieces of information and the edges represent relationships between those pieces. This scheme supports three related models of information, the underlying graph structure, the graph clustered according to some geometric attributes and, the graph represented according to some drawing mechanism. Also introduced is a method for reducing the computational complexity of a graph drawing algorithm called, force directed placement,fromO(n 2 ) to O(n log n). This method is adapted from an nbody hierarchical force calculation, that allows larger data sets to be draw and visualized on various levels of abstraction. Finally, this method provides the framework for the integration and testing of numerous concepts about how the quality of layout and clustering are related.
Drawing Graphs with Nonuniform Nodes Using Potential Fieldsā
"... Graphs with nonuniform nodes arise naturally in many realworld applications. Although graph drawing has been a very active research in the computer science community during the past decade, most of the graph drawing algorithms developed thus far have been designed for graphs whose nodes are represe ..."
Abstract
 Add to MetaCart
(Show Context)
Graphs with nonuniform nodes arise naturally in many realworld applications. Although graph drawing has been a very active research in the computer science community during the past decade, most of the graph drawing algorithms developed thus far have been designed for graphs whose nodes are represented as single points. As a result, it is of importance to develop drawing methods for graphs whose nodes are of different sizes and shapes, in order to meet the need of realworld applications. To this end, a potential field approach, coupled with an idea commonly found in forcedirected methods, is proposed in this paper for drawing graphs with nonuniform nodes in 2D and 3D. In our framework, nonuniform nodes are uniformly charged, while edges are modelled by springs. Using certain techniques developed in the field of potentialbased path planning, we are able to find analytically tractable procedures for computing the repulsive force and torque of a node in the potential field induced by the remaining nodes. The crucial feature of our approach is that the rotation of every nonuniform node and the multiple edges between two nonuniform nodes are taken into account. In comparison with the existing algorithms found in the literature, our experimental results suggest this new approach to be promising, as drawings of good quality for a variety of moderatesized graphs in 2D and 3D can be produced reasonably efficiently. That is, our approach is suitable for moderatesized interactive graphs or largersized static graphs. Furthermore, to illustrate the usefulness of our new drawing method for graphs with zerosized nodes, we give an application to the visualization of hierarchical clustered graphs, for which our method offers a very efficient solution. 1.
ReVis: Reverse Engineering by Clustering and Visual Object Classification
, 2000
"... This paper presents the framework of a scaleoriented scheme for the presentation and classification of reverse engineered sections of procedural code into objects. The aim is to develop an extensible system framework, which allows the output from a suite of data analysis tools to be visually presen ..."
Abstract
 Add to MetaCart
This paper presents the framework of a scaleoriented scheme for the presentation and classification of reverse engineered sections of procedural code into objects. The aim is to develop an extensible system framework, which allows the output from a suite of data analysis tools to be visually presented to a user. The relationship between the analysis and visualisation is a progressive cycle, where each time through the cycle the overall quality of the classified objects improves. This framework supports two distinct methods of information feedback from the visualisation to the analysis suite. The two feedback loops aim to increase both the ease of understanding for the reverse engineer and the quality of the resultant objects. As the analyst views the visualisation the perceived view of the relationships exhibited in the system may be modified, removed or added to. This results in a change to the underlying graph or the clustering of that graph, which must be addressed in the visual presentation of the information using a variety of techniques to maintain the users `mental map', or understanding each time through the cycle.