Results 201 to 210 of about 57,181 (227)
Some of the next articles are maybe not open access.
Ars Comb., 2001
The authors present an algorithm for constructing a straight line drawing with no crossings on a rectangular representation of the torus for graphs with a toroidal rotation system given (i.e.\ with correctly prescribed cyclic order of the edges at each vertex). This algorithm runs in linear time with respect to the number of vertices.
William L. Kocay +2 more
openaire +1 more source
The authors present an algorithm for constructing a straight line drawing with no crossings on a rectangular representation of the torus for graphs with a toroidal rotation system given (i.e.\ with correctly prescribed cyclic order of the edges at each vertex). This algorithm runs in linear time with respect to the number of vertices.
William L. Kocay +2 more
openaire +1 more source
2003
The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an ability to compute optimal layouts (according to specific requirements) and a very rapid computation time.
openaire +1 more source
The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an ability to compute optimal layouts (according to specific requirements) and a very rapid computation time.
openaire +1 more source
Drawing graphs with attribute graph grammars
1996We address the problem of automatically generating layouts for graphs using graph grammars.
Gaby Zinßmeister, Carolyn McCreary
openaire +1 more source
2003
Automatic aesthetic drawing of plane graphs has recently created intense interest due to its broad applications, and as a consequence, a number of drawing methods, such as the straight line drawing, convex drawing, orthogonal drawing, rectangular drawing and box-rectangular drawing, have come out [8,9,3,4,5,6,7, 10,11,14,16,23,29,33].
openaire +1 more source
Automatic aesthetic drawing of plane graphs has recently created intense interest due to its broad applications, and as a consequence, a number of drawing methods, such as the straight line drawing, convex drawing, orthogonal drawing, rectangular drawing and box-rectangular drawing, have come out [8,9,3,4,5,6,7, 10,11,14,16,23,29,33].
openaire +1 more source
Constraints in Graph Drawing Algorithms
Constraints, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA), 2015
Michael A. Bekos +2 more
openaire +1 more source
Michael A. Bekos +2 more
openaire +1 more source
Proceedings of the first annual symposium on Computational geometry - SCG '85, 1985
Richard J. Lipton +2 more
openaire +1 more source
Richard J. Lipton +2 more
openaire +1 more source
Graph-based method for face identification from a single 2D line drawing
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2001Jianzhuang Liu, Yong Tsui Lee
exaly
Mental map preserving graph drawing using simulated annealing
Information Sciences, 2011Chun-Cheng Lin, Hsu-Chun Yen
exaly

