121
click to vote
GD
15 years 5 months ago
2006 Springer 
We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs....
125
click to vote
GD
15 years 5 months ago
2006 Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
111
click to vote
GD
15 years 5 months ago
2006 Springer 
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
116
click to vote
GD
15 years 5 months ago
2006 Springer
We consider graph drawing algorithms for learning spaces, a type of st-oriented partial cube derived from an antimatroid and used to model states of knowledge of students. We show...
116
click to vote
GD
15 years 5 months ago
2006 Springer 
Graph drawing software are now commonly used. However, the choice of a well-adapted program may be hard for an inexperienced user. This poster presents a website (http://www.polyte...
|
Computer Graphics