Sciweavers

36 search results - page 1 / 8
» Fast Node Overlap Removal
Sort
View
GD
2005
Springer
13 years 10 months ago
Fast Node Overlap Removal
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...
Tim Dwyer, Kim Marriott, Peter J. Stuckey
ACSC
2003
IEEE
13 years 10 months ago
Force-Transfer: A New Approach to Removing Overlapping Nodes in Graph Layout
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 ...
Xiaodi Huang, Wei Lai
ISCI
2007
96views more  ISCI 2007»
13 years 4 months ago
A new algorithm for removing node overlapping in graph visualization
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...
Xiaodi Huang, Wei Lai, A. S. M. Sajeev, Junbin Gao
JGAA
2010
74views more  JGAA 2010»
13 years 3 months ago
Efficient, Proximity-Preserving Node Overlap Removal
Emden R. Gansner, Yifan Hu
DAC
2010
ACM
12 years 12 months ago
Node addition and removal in the presence of don't cares
This paper presents a logic restructuring technique named node addition and removal (NAR). It works by adding a node into a circuit to replace an existing node and then removing t...
Yung-Chih Chen, Chun-Yao Wang