51 search results - page 1 / 11 » A new algorithm for removing node overlapping in graph visua... |
ISCI
2007
13 years 4 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...
ACSC
2003
IEEE
13 years 10 months ago
2003
IEEE
Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in ...
ACSC
2005
IEEE
13 years 10 months ago
2005
IEEE
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
GD
2005
Springer
13 years 10 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
SAC
2009
ACM
13 years 11 months ago
2009
ACM
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...