52 search results - page 8 / 11 » Crossing minimization in extended level drawings of graphs |
CGF
2010
13 years 8 months ago
2010
Visualizing graphs containing many nodes and edges efficiently is quite challenging. Drawings of such graphs generally suffer from visual clutter induced by the large amount of ed...
GD
2006
Springer
14 years 2 days ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
SIGCSE
2004
ACM
14 years 1 months ago
2004
ACM
A framework for producing dynamic data structure visualizations within the context of a lightweight IDE is described. Multiple synchronized visualizations of a data structure can ...
SOFTVIS
2003
ACM
14 years 1 months ago
2003
ACM
UML diagrams have become increasingly important in the engineering and reengineering processes for software systems. Of particular interest are UML class diagrams whose purpose is...
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...