942 search results - page 23 / 189 » Constraints in Graph Drawing Algorithms |
COMGEO
2004
ACM
13 years 8 months ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
We present a simple linear time algorithm for drawing level graphs with a given ordering of the vertices within each level. The algorithm draws in a radial fashion without changing...
GD
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We introduce a new graph drawing convention for 3D hierarchical drawings of directed graphs. The vertex set is partitioned into layers of vertices drawn in parallel plane...
ISBRA
2009
Springer
14 years 3 months ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
VL
1994
IEEE
14 years 23 days ago
1994
IEEE
Stretch-A-Sketch is a pen-based drawing program that combines recognition of hand-drawn glyphs with constraint based maintenance of spatial relations. The recognition program iden...