8 search results - page 1 / 2 » SDE: Graph Drawing Using Spectral Distance Embedding |
GD
2005
Springer
13 years 10 months ago
2005
Springer
GD
2006
Springer
13 years 8 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,...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...
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 ...
CAD
2007
Springer
13 years 5 months ago
2007
Springer
We present an approach for robust shape retrieval from databases containing articulated 3D models. Each shape is represented by the eigenvectors of an appropriately defined affin...