-
Currently, we offer two versions of the Laplace operator - de Rham and Beltrami - for each form and each dimension of delta dual complex.
However, we do not generate Laplacians for simplicial sets. T…
-
Implement a fast method for solving Laplacian systems.
This will likely be the Approximate Cholesky Factorisation method described in 'Robust and Practical Solution of Laplacian Equations by Approx…
pmacg updated
6 months ago
-
hello, thanks for this implementation. how would you go about implementing the gradient or laplacian supervision? i wonder if it is involving the gradient of the network directly or some sort of sobel…
-
Thank you for for the great research on spherical graphs.
In https://github.com/deepsphere/deepsphere-pytorch/blob/master/deepsphere/utils/laplacian_funcs.py
the code attempts to import the class…
-
The implementation of `laplacian_matrix()` in 2.0 looks at least suspicious to me. This function does not have tests at the moment. Adding tests that check that nothing changed since 1.6.0 should be a…
-
Hi 👋 !
As discussed on Slack, adding the scalar Laplacian to the package could be interesting. As a reminder, the scalar [Laplacian](https://en.wikipedia.org/wiki/Laplace%E2%80%93Beltrami_operator) i…
-
Would it be possible to add this algorithm to the edge detection list?
-
Hi,
Thanks for your wonderful contribution!
In your paper: [A Laplacian for Nonmanifold Triangle Meshes], you mentioned the method to build mesh Laplacian with cotangent weights. But I would like …
-
A question of performance (for code that I wrote). I have noticed that creating finite subsections of matrices can sometimes be slow:
```
julia> Z = ZernikeAnnulus(0.5,1,1); wZ = Weighted(Z);
ju…
-
- [ ] Add an user-defined internal WB aiming at normalizing clipped color to white during the correction (helps recovering more magenta in fewer iterations),
- [ ] Add an exposure sanitization step …