Results 1 
5 of
5
A Multilevel Algorithm for ForceDirected GraphDrawing
, 2003
"... We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a forcedirected placement algorithm. ..."
Abstract

Cited by 89 (3 self)
 Add to MetaCart
We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a forcedirected placement algorithm.
Graph Drawing in Motion
 Journal of Graph Algorithms and Applications
, 2002
"... Enabling the user of a graph drawing system to preserve the mental map between two di#erent layouts of a graph is a major problem. In this paper we present methods that smoothly transform one drawing of a graph into another without any restrictions to the class of graphs or type of layout algori ..."
Abstract

Cited by 28 (0 self)
 Add to MetaCart
Enabling the user of a graph drawing system to preserve the mental map between two di#erent layouts of a graph is a major problem. In this paper we present methods that smoothly transform one drawing of a graph into another without any restrictions to the class of graphs or type of layout algorithm.
Nice Perspective Projections
"... this paper we consider the problem of computing a variety of nice perspective projections of threedimensional objects such as simple polygonal chains, wireframe drawings of graphs and geometric rooted trees. These problems arise in areas such as Computer Vision, Computer Graphics, Graph Drawin ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
this paper we consider the problem of computing a variety of nice perspective projections of threedimensional objects such as simple polygonal chains, wireframe drawings of graphs and geometric rooted trees. These problems arise in areas such as Computer Vision, Computer Graphics, Graph Drawing, Knot Theory and Computational Geometry. 1. INTRODUCTION When we draw or plot an image of a threedimensional (3D) object on a sheet of paper, or when we use a displaying device, such as a computer graphics screen, we obtain a 2D representation that necessarily approximates the 3D object and will never capture all its properties. It is obviously desirable to make this single * The research of the rst author was supported by MECDGESSEUID PB980933. The second author was supported by MECDGESSEUID PB980933 and DURSI 1999SGR00356. Research of the third author was supported by MECDGESSEUID PB980933 and DURSI 1999SGR00162. The fou
Interactive, Treebased Graph Visualization
, 2006
"... We introduce an interactive graph visualization scheme that allows users to explore graphs by viewing them as a sequence of spanning trees, rather than the entire graph all at once. The user determines which spanning trees are displayed by selecting a vertex from the graph to be the root. Our main c ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We introduce an interactive graph visualization scheme that allows users to explore graphs by viewing them as a sequence of spanning trees, rather than the entire graph all at once. The user determines which spanning trees are displayed by selecting a vertex from the graph to be the root. Our main contributions are a graph drawing algorithm that generates meaningful representations of graphs using extracted spanning trees, and a graph animation algorithm for creating smooth, continuous transitions between graph drawings. We conduct experiments to measure how well our algorithms visualize graphs and compare
Improved Layouts of the Multigrid Network
"... In a previous paper, Calamoneri and Massini studied the problem of drawing the multigrid network in “a grid of minimum area”. In this paper we show that we can draw the multigrid network in a smaller grid, and can reduce the number of bends and the number of crossings as well. node (i, j) of the N/2 ..."
Abstract
 Add to MetaCart
In a previous paper, Calamoneri and Massini studied the problem of drawing the multigrid network in “a grid of minimum area”. In this paper we show that we can draw the multigrid network in a smaller grid, and can reduce the number of bends and the number of crossings as well. node (i, j) of the N/2 k × N/2 k array is connected to node (2i, 2j) of the N/2 k−1 × N/2 k−1 array for all 0 ≤ i, j ≤ N/2 k − 1. See also Fig. 1. 1