Timeline for Fast Fourier transform for graph Laplacian?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 4, 2022 at 4:34 | history | edited | Martin Sleziak |
added the tag (laplacian)
|
|
| Jun 7, 2022 at 20:33 | history | edited | YCor | CC BY-SA 4.0 |
formatting
|
| Jun 7, 2022 at 20:28 | answer | added | Sébastien Loisel | timeline score: 0 | |
| May 22, 2015 at 14:14 | comment | added | Ziyuan | @SteveHuntsman It now says Your search did not match any articles. | |
| Aug 12, 2010 at 20:12 | answer | added | dranxo | timeline score: 5 | |
| Apr 10, 2010 at 3:22 | comment | added | Steve Huntsman | This paper is available at, e.g. scholar.google.com/… | |
| Apr 10, 2010 at 3:22 | comment | added | Steve Huntsman | From "Discrete Combinatorial Laplacian Operators for Digital Geometry Processing" by Hao Zhang: "the eigenvectors of the TL [Tutte Laplacian] represent the natural vibration modes of the mesh, while the corresponding eigenvalues capture its natural frequencies, resembling the scenario for [the] classical discrete Fourier Transform (DFT). However, the eigenvectors of the TL possess no analytical form in general and there are no fast methods, analogous to the Fast Fourier Transform, to compute the corresponding mesh signal transform." | |
| Mar 1, 2010 at 2:08 | history | asked | TerronaBell | CC BY-SA 2.5 |