326 search results - page 27 / 66 » A Library of Algorithms for Graph Drawing |
SMA
2008
ACM
14 years 8 months ago
2008
ACM
View identification is the basal process for solid reconstruction from engineering drawings. A new method is presented to label various views from a section-involved drawing and i...
GD
2009
Springer
15 years 2 months ago
2009
Springer
Canonical ordering is an important tool in planar graph drawing and other applications. Although a linear-time algorithm to determine canonical orderings has been known for a while...
AGTIVE
1999
Springer
15 years 1 months ago
1999
Springer
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming l...
GD
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
ISCI
2007
14 years 9 months ago
2007
Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs. When nodes must be labeled however, the problem of overlapping nodes arises, p...