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
When building a grid using lots of points, which is especially necessary to produce accurate images of complex geometries, the Delaunay triangulation is a large bottleneck in the smoothing process. Can the Delaunay triangulation be parallelised like the non-LTE level population calculation and raytracing? I understand this is a difficult problem because a point may affect the entire triangulation, but I believe a partitioning method can be used- unfortunately that's the extent of my expertise here.
The text was updated successfully, but these errors were encountered:
@lolMEvans :
You could try using par->samplingAlgorithm=1, which won't do any smoothing at all. Anyway, the default sampling algorithm uses 20 smoothing iterations (set in lime.h with N_SMOOTH_ITERS), which is probably excessive. Maybe we should change the default value to, say, 5. Moreover, should the default par->samplingAlgorithm be changed to 1?
However, even without extra smoothing iterations the Delaunay triangulation may end up taking a long time if there's a lot of points. There some parallel Delaunay implementations, but changing LIME to use any them would probably be a bit of an undertaking. Switching to something other than qhull for triangulation has been in the plans for a number of reasons, but I'm not sure who will do that and when.
I don't have anything to add... I'm about to release 1.8, which I have checked out probably more thoroughly than any LIME so far, including for par->samplingAlgorithm=1.
When building a grid using lots of points, which is especially necessary to produce accurate images of complex geometries, the Delaunay triangulation is a large bottleneck in the smoothing process. Can the Delaunay triangulation be parallelised like the non-LTE level population calculation and raytracing? I understand this is a difficult problem because a point may affect the entire triangulation, but I believe a partitioning method can be used- unfortunately that's the extent of my expertise here.
The text was updated successfully, but these errors were encountered: