Results 1 
7 of
7
Drawing on Physical Analogies
, 2001
"... in Sections 4.2 and 4.3. An asset of physical modeling that is often overlooked is its inherent exibility. For this reason, we conclude this chapter by listing examples of model speci cations tailored to speci c layout objectives. 4.1 The Springs Given a connected undirected graph with no partic ..."
Abstract

Cited by 30 (2 self)
 Add to MetaCart
in Sections 4.2 and 4.3. An asset of physical modeling that is often overlooked is its inherent exibility. For this reason, we conclude this chapter by listing examples of model speci cations tailored to speci c layout objectives. 4.1 The Springs Given a connected undirected graph with no particular background information, the following two criteria of readable layout seem to be generally agreed upon for the conventional twodimensional straightline representation. 1. Vertices should spread well on the page. 2. Adjacent vertices should be close. Only intuitive explanations can be oered. While uniform vertex distribution reduces clutter, the implied uniform edge lengths leave an undistorted impression of the graph. Since \clutter" and \distortion" already have physical connotations, it seems fairly natural to start thinking of a more speci c physical analogy. We are used to observing even spacing between repelling objects. This makes it natural to imagine vertices behaving l
ThreeDimensional Orthogonal Graph Drawing with Optimal Volume
"... An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axisaligned boxes, and edges represented by paths in the grid which only possibly intersect at common endpoints. In this paper, we study threedimensional orthogonal drawings and prov ..."
Abstract

Cited by 23 (8 self)
 Add to MetaCart
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axisaligned boxes, and edges represented by paths in the grid which only possibly intersect at common endpoints. In this paper, we study threedimensional orthogonal drawings and provide lower bounds for three scenarios: (1) drawings where vertices have bounded aspect ratio, (2) drawings where the surface of vertices is proportional to their degree, and (3) drawings without any such restrictions. Then we show that these lower bounds are asymptotically optimal, by providing constructions that match the lower bounds in all scenarios within an order of magnitude.
Drawing Clusters and Hierarchies
, 2001
"... with respect to edges can be of interest as well. A method to do this can be found in Paulish (1993, Chapter 5). Clustering of graphs means grouping of vertices into components called clusters. Thus, clustering is related to partitioning the vertex set. Denition 8.1 (Partition). A (kway) partitio ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
with respect to edges can be of interest as well. A method to do this can be found in Paulish (1993, Chapter 5). Clustering of graphs means grouping of vertices into components called clusters. Thus, clustering is related to partitioning the vertex set. Denition 8.1 (Partition). A (kway) partition of a set C is a family of subsets (C 1 ; : : : ; C k ) with { S k i=1 C i = C and { C i \ C j = ; for i 6= j. The C i are called parts. We refer to a 2way partition as a bipartition. Now, we can dene one of the most basic denitions of clustered graphs. 8. Drawing Clusters and Hierarchies 195<F14.
MultiDimensional Orthogonal Graph Drawing with Small Boxes
 Proc. 7th International Symp. on Graph Drawing (GD '99
, 1999
"... In this paper we investigate the general position model for the drawing of arbitrary degree graphs in the Ddimensional (D >= 2) orthogonal grid. In this model no two vertices lie in the same grid hyperplane. ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
(Show Context)
In this paper we investigate the general position model for the drawing of arbitrary degree graphs in the Ddimensional (D >= 2) orthogonal grid. In this model no two vertices lie in the same grid hyperplane.
Lower Bounds for the Number of Bends in ThreeDimensional Orthogonal Graph Drawings
, 2003
"... This paper presents the first nontrivial lower bounds for the total number of bends in 3D orthogonal graph drawings with vertices represented by points. In particular, we prove lower bounds for the number of bends in 3D orthogonal drawings of complete simple graphs and multigraphs, which are tigh ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
This paper presents the first nontrivial lower bounds for the total number of bends in 3D orthogonal graph drawings with vertices represented by points. In particular, we prove lower bounds for the number of bends in 3D orthogonal drawings of complete simple graphs and multigraphs, which are tight in most cases. These result are used as the basis for the construction of infinite classes of cconnected simple graphs, multigraphs, and pseudographs (2 &le; c &le; 6) of maximum degree &Delta; (3 &le; &Delta; &le; 6), with lower bounds on the total number of bends for all members of the class. We also present lower bounds for the number of bends in general position 3D orthogonal graph drawings. These results have significant ramifications for the `2bends problem', which is one of the most important open problems in the field.
Nearly Optimal Three Dimensional Layout of Hypercube Networks ⋆
"... Abstract. In this paper we consider the threedimensional layout of hypercube networks. Namely, we study the problem of laying hypercube networks out on the threedimensional grid with the properties that all nodes are represented as rectangular slices and lie on two opposite sides of the bounding b ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. In this paper we consider the threedimensional layout of hypercube networks. Namely, we study the problem of laying hypercube networks out on the threedimensional grid with the properties that all nodes are represented as rectangular slices and lie on two opposite sides of the bounding box of the layout volume. We present both a lower bound and a layout method providing an upper bound on the layout volume and the maximum wirelength of the hypercube network.