Tony Vladusich on Nostr: nprofile1q…ufa4k Funnily enough, one of the papers I had in mind relies heavily on ...
nprofile1qy2hwumn8ghj7un9d3shjtnddaehgu3wwp6kyqpqknzsux7p6lzwzdedp3m8c3c92z0swzc0xyy5glvse58txj5e9ztqaufa4k (nprofile…fa4k)
Funnily enough, one of the papers I had in mind relies heavily on the graph Laplacian to solve the Laplace equation on a graph. This is particularly useful when one wishes to work on spatial domains in which nodes are non-uniformly distributed w.r.t to the range, such as the complex logarithmic mapping of visual coordinates in human vision. A lot of recent vision work has involved graph theoretic discrete calculus methods. It's a super interesting field but not my area of expertise by any means. So I might ask you questions from time to time, if you don't mind answering them?
Funnily enough, one of the papers I had in mind relies heavily on the graph Laplacian to solve the Laplace equation on a graph. This is particularly useful when one wishes to work on spatial domains in which nodes are non-uniformly distributed w.r.t to the range, such as the complex logarithmic mapping of visual coordinates in human vision. A lot of recent vision work has involved graph theoretic discrete calculus methods. It's a super interesting field but not my area of expertise by any means. So I might ask you questions from time to time, if you don't mind answering them?