Smooths out points using a low pass filter either by Taubin or Laplacian algorithm.
1. OpenCL acceleration.
2. VEX code branch.
3. Two algorithms to choose from: Taubin and Laplacian. I merged the Relax SOP code into this operator as Laplacian.
4. Ability to use edge or primitive neighbours with any depth.
5. Ability to use point clouds to find neighbours instead of connectivity.
6. Ability to reproject geometry onto original input geometry at each iteration.
7. Ability to constrain borders.
8. Optimized OpenCL relaxing code. Reduced iterations by half.
9. Includes 2 more SOPs inside: Neighbour and Proximity SOP.
Neighbour SOP: Stores an array of points that are connected to each point by edges or primitives.
Proximity SOP: Queries point clouds using proximity optionally with variable radius per point. Includes a ton of options to save the nearest/fartest point(s)/distance(s)/count and density as attributes with the ability to include/exclude the current point itself.
It can also perform point cloud lookups using the second input.
https://www.dropbox.com/s/27z2quv51b7kk15/Smooth_SOP_Animatrix.otl?dl=1
https://www.dropbox.com/s/tngfkrdijn1v2r3/Proximity_SOP_Animatrix.otl?dl=1
https://www.dropbox.com/s/vxa817d3nsf7act/Neighbour_SOP_Animatrix.otl?dl=1