3 search results - page 1 / 1 » SSDE: Fast Graph Drawing Using Sampled Spectral Distance Emb... |
GD
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
GD
2005
Springer
13 years 10 months ago
2005
Springer
CGF
2007
13 years 5 months ago
2007
We propose a mesh segmentation algorithm via recursive bisection where at each step, a sub-mesh embedded in 3D is first spectrally projected into the plane and then a contour is ...