Results 1  10
of
391,926
Fully Dynamic 3Dimensional Orthogonal Graph Drawing
 J. Graph Algorithms Appl
, 2001
"... In a 3dimensional orthogonal drawing of a graph, vertices are mapped to grid points on a 3dimensional rectangular integer lattice and edges are routed along integer grid lines. In this paper, we present a technique that produces a 3D orthogonal drawing of any graph with n vertices of degree 6 or l ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
In a 3dimensional orthogonal drawing of a graph, vertices are mapped to grid points on a 3dimensional rectangular integer lattice and edges are routed along integer grid lines. In this paper, we present a technique that produces a 3D orthogonal drawing of any graph with n vertices of degree 6
Fully Dynamic 3Dimensional . . .
 J. GRAPH ALGORITHMS APPL
, 2000
"... In a 3dimensional orthogonal drawing of a graph, vertices are mapped to grid points on a 3dimensional rectangular integer lattice and edges are routed along integer grid lines. In this paper, we present a technique that produces a 3D orthogonal drawing of any graph with n vertices of degree 6 or l ..."
Abstract
 Add to MetaCart
In a 3dimensional orthogonal drawing of a graph, vertices are mapped to grid points on a 3dimensional rectangular integer lattice and edges are routed along integer grid lines. In this paper, we present a technique that produces a 3D orthogonal drawing of any graph with n vertices of degree 6
Refinement of Orthogonal Graph Drawings
, 1998
"... Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the readability of orthogonal drawings can be significantly improved with a postprocessing technique, called refinement, which improves aesthetic qualities of a drawing such as area, bends, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the readability of orthogonal drawings can be significantly improved with a postprocessing technique, called refinement, which improves aesthetic qualities of a drawing such as area, bends
Orthogonal drawings with few layers
 PROC. 9TH INTERNATIONAL SYMP. ON GRAPH DRAWING (GD '01
, 2002
"... In this paper, we study 3dimensional orthogonal graph drawings. Motivated by the fact that only a limited number of layers is possible in VLSI technology, and also noting that a small number of layers is easier to parse for humans, we study drawings where one dimension is restricted to be very smal ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
In this paper, we study 3dimensional orthogonal graph drawings. Motivated by the fact that only a limited number of layers is possible in VLSI technology, and also noting that a small number of layers is easier to parse for humans, we study drawings where one dimension is restricted to be very
Drawing Clustered Graphs on an Orthogonal Grid
, 1999
"... Clustered graphs are graphs with recursive clustering structures over the vertices. For graphical representation, the clustering structure is represented by a simple region that contains the drawing of all the vertices which belong to that cluster. In this paper, we present an algorithm which pr ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
produces planar drawings of clustered graphs in a convention known as orthogonal grid rectangular cluster drawings. If the input graph has n vertices, then the algorithm produces in O(n) time a drawing with O(n²) area and at most 3 bends in each edge. This result is as good as existing results
Techniques for the Refinement of Orthogonal Graph Drawings
, 2000
"... Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a postprocessing technique, called refinement, which improves aesthetic qualities of a drawing such as area, bends, crossin ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a postprocessing technique, called refinement, which improves aesthetic qualities of a drawing such as area, bends
Fully Dynamic Orthogonal Graph Layout for Interactive Systems
, 2000
"... We combine and supplement existing approaches to arrive at a general algorithm for dynamic orthogonal graph drawing with few bends. Our approach is applicable to nonplanar graphs with vertices of arbitrary degree, reduces the number of bends if possible, allows explicit control of the bendnumber/ ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We combine and supplement existing approaches to arrive at a general algorithm for dynamic orthogonal graph drawing with few bends. Our approach is applicable to nonplanar graphs with vertices of arbitrary degree, reduces the number of bends if possible, allows explicit control of the bend
Network Centric Warfare: Developing and Leveraging Information Superiority
 Command and Control Research Program (CCRP), US DoD
, 2000
"... the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technolo ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technologies. The CCRP pursues a broad program of research and analysis in information superiority, information operations, command and control theory, and associated operational concepts that enable us to leverage shared awareness to improve the effectiveness and efficiency of assigned missions. An important aspect of the CCRP program is its ability to serve as a bridge between the operational, technical, analytical, and educational communities. The CCRP provides leadership for the command and control research community by: n n
Graph Drawing
 Lecture Notes in Computer Science
, 1997
"... INTRODUCTION Graph drawing addresses the problem of constructing geometric representations of graphs, and has important applications to key computer technologies such as software engineering, database systems, visual interfaces, and computeraideddesign. Research on graph drawing has been conducte ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
INTRODUCTION Graph drawing addresses the problem of constructing geometric representations of graphs, and has important applications to key computer technologies such as software engineering, database systems, visual interfaces, and computeraideddesign. Research on graph drawing has been
Results 1  10
of
391,926