Results 1  10
of
88,033
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 627 (44 self)
 Add to MetaCart
graphs. These algorithms adopt a variety of representations (e.g., straightline, polyline, visibility), and update the drawing in a smooth way.
AreaEfficient Algorithms for Upward StraightLine Tree Drawings (Extended Abstract)
 in: Proc. COCOON ‘96
, 1996
"... ) ChanSu Shin 1 and Sung Kwon Kim 2 and KyungYong Chwa 1 1 Dept. of Computer Science, Korea Advanced Institute of Science and Technology, Taejon 305701, Korea, fcssin, kychwag@jupiter.kaist.ac.kr. 2 Dept. of Computer Science and Engineering, ChungAng University, Seoul 156756, Korea, ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
, ksk@point.cse.cau.ac.kr. Abstract. In this paper, we investigate planar upward straightline grid drawing problems for boundeddegree rooted trees so that a drawing takes up as little area as possible. A planar upward straightline grid tree drawing satisfies the following four constraints: (1
Straightline drawings of outerplanar graphs in O(dnlogn) area
 Canadian Conference on Computational Geometry (CCCG ’07
, 2007
"... We show an algorithm for constructing O(dn log n) area outerplanar straightline drawings of nvertex outerplanar graphs with degree d. Also, we settle in the negative a conjecture [1] on the area requirement of outerplanar graphs by showing that snowflake graphs admit linear area drawings. 1 ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We show an algorithm for constructing O(dn log n) area outerplanar straightline drawings of nvertex outerplanar graphs with degree d. Also, we settle in the negative a conjecture [1] on the area requirement of outerplanar graphs by showing that snowflake graphs admit linear area drawings. 1
Straightline Drawings of 1planar Graphs
"... Abstract. The classical Fáry’s theorem from the 1930s states that every planar graph can be drawn as a straightline drawing. In this paper, we extend Fáry’s theorem to nonplanar graphs. More specifically, we study the problem of drawing 1planar graphs with straightline edges. A 1planar graph is ..."
Abstract
 Add to MetaCart
for which every straightline drawing has exponential area. To our best knowledge, this is the first result to extend Fáry’s theorem to nonplanar graphs. 1
AreaEfficient Static and Incremental Graph Drawings
, 1997
"... In this paper, we present algorithms to produce orthogonal drawings of arbitrary graphs. As opposed to most known algorithms, we do not restrict ourselves to graphs with maximum degree 4. The best previous result gave an (m \Gamma 1) \Theta ( m 2 + 1)grid for graphs with n nodes and m edges. We p ..."
Abstract

Cited by 36 (6 self)
 Add to MetaCart
In this paper, we present algorithms to produce orthogonal drawings of arbitrary graphs. As opposed to most known algorithms, we do not restrict ourselves to graphs with maximum degree 4. The best previous result gave an (m \Gamma 1) \Theta ( m 2 + 1)grid for graphs with n nodes and m edges. We
StraightLine Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
 Algorithmica
, 1999
"... Hierarchical graphs and clustered graphs are useful nonclassical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in CASE tools, software visualizatio ..."
Abstract

Cited by 70 (12 self)
 Add to MetaCart
visualization, and VLSI design. Drawing algorithms for hierarchical graphs have been well investigated. However, the problem of straightline representation has not been solved completely. In this paper, we answer the question: does every planar hierarchical graph admit a planar straightline hierarchical
StraightLine Drawings on Restricted Integer Grids in Two and Three Dimensions
"... This paper investigates the following question: Given a grid φ, where φ is a proper subset of the integer 2D or 3D grid, which graphs admit straightline crossingfree drawings with vertices located at (integral) grid points of φ? We characterize the trees that can be drawn on a strip, i.e., on a tw ..."
Abstract
 Add to MetaCart
This paper investigates the following question: Given a grid φ, where φ is a proper subset of the integer 2D or 3D grid, which graphs admit straightline crossingfree drawings with vertices located at (integral) grid points of φ? We characterize the trees that can be drawn on a strip, i.e., on a
StraightLine Drawings of Graphs in Three Dimensions
"... This is an overview of results and open problems pertaining to straightline drawings of graphs in integer grids, in particular when drawn in three dimensions. As presented at: Journees de Geometrie Algorithmique 2002. ..."
Abstract
 Add to MetaCart
This is an overview of results and open problems pertaining to straightline drawings of graphs in integer grids, in particular when drawn in three dimensions. As presented at: Journees de Geometrie Algorithmique 2002.
Results 1  10
of
88,033