You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
From what I can tell this should be possible in at least MarchingCubes and NaiveSurfaceNets. There are some other optimizations from the NaiveSurfaceNet implementation I would also like to apply to MarchingCubes and Marching Tetrahedra.
The text was updated successfully, but these errors were encountered:
I think I am running into the closure inference bug on 1.1 because an Int declaration seems to be getting boxed and is triggering the GC quite a bit. Hopefully 1.2 helps. I have seen ~12x performance improvements on the distance field sampling side with threads and SIMD, but meshing is still the performance bottleneck in my applications.
Alternatively I may port a GPU example and use CUDANative and/or OpenCL.
From what I can tell this should be possible in at least MarchingCubes and NaiveSurfaceNets. There are some other optimizations from the NaiveSurfaceNet implementation I would also like to apply to MarchingCubes and Marching Tetrahedra.
The text was updated successfully, but these errors were encountered: