نتایج جستجو برای: drawing table
تعداد نتایج: 164772 فیلتر نتایج به سال:
We propose a method for visualizing a set of related metabolic pathways across organisms using 2 1/2 dimensional graph visualization. Interdependent, twodimensional layouts of each pathway are stacked on top of each other so that biologists get a full picture of subtle and significant differences among the pathways. The (dis)similarities between pathways are expressed by the Hamming distances o...
Cognitive experiments show that humans can read graph drawings in which all edge crossings are at right angles equally well as they can read planar drawings; they also show that the readability of a drawing is heavily affected by the number of bends along the edges. A graph visualization whose edges can only cross perpendicularly is called a RAC (Right Angle Crossing) drawing. This paper initia...
An IC-plane graph is a topological graph where every edge is crossed at most once and no two crossed edges share a vertex. We show that every IC-plane graph has a visibility drawing where every vertex is of the form { , , , }, and every edge is either a horizontal or vertical segment. As a byproduct of our drawing technique, we prove that every IC-plane graph has a RAC drawing in quadratic area...
This report describes the Fourth Annual Graph Drawing Contest, held in conjunction with the 1997 Graph Drawing Symposium in Rome, Italy. The purpose of the contest is to monitor and challenge the current state of the art in graph-drawing technology [2, 3, 4]. This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without ...
Let R and B be two disjoint sets of points in the plane such that |B| 6 |R|, and no three points of R ∪ B are collinear. We show that the geometric complete bipartite graph K(R,B) contains a non-crossing spanning tree whose maximum degree is at most max { 3, ⌈ |R|−1 |B| ⌉ + 1 } ; this is the best possible upper bound on the maximum degree. This solves an open problem posed by Abellanas et al. a...
We show that there exist triangulations that do not admit any planar straight-line drawing in which every face is an isosceles triangle, thus partially solving a question posed in [Demaine, Mitchell, O’Rourke – The Open Problems Project ].
Symmetry is one of the most important aesthetic criteria in graph drawing because it reveals structure in the graph. To draw graphs symmetrically, we employ two steps. The first step is to find appropriate automorphisms. The second step is to draw the graph to display the automorphisms. Our aim in this paper is to construct maximally symmetric straight line drawings of triconnected planar graph...
The adoption of the stress-majorization method frommulti-dimensional scaling into graph layout has provided an improved mathematical basis and better convergence properties for so-called “force-directed placement” techniques. In this paper we give an algorithm for augmenting such stress-majorization techniques with orthogonal ordering constraints and we demonstrate several graphdrawing applicat...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید