> During N timesteps, use the same list of interactions (some will go > from > virtual to real, or real to virtual, no problem with that as long as > they can change many times). > I experimented that before with the triangulation collider, it worked > well, but it was not faster than SAPcollider for a stupid reason (*), > and I realised the same thing could be achieved with SAPcollider with > intDetectionFactor=1.5. > It needs a few adjustments in other classes now, perhaps, perhaps not.
Hi Bruno, I played with this idea yesterday, and it is commited in r1851. The interface is quite crude, but you will get the idea from scripts/test/collider-stride-triax.py, where you can play with the parameters and so on. I was able to get collider time percentage down to 3.5% as speed decreases, running about every 48 steps. (60% for InteractionDispatchers, 22% NewtonsDampedLaw, 8% for TriaxialCompressionEngine). The script gives you the opportunity to try different strategies to determine the best values for stride/sweep distance. I have to try for my "slowly moving" (absolute speeds are high, but timestep is very small) problems, where it can make huge difference. If you have any propositions how to make ti faster, go ahead and try. Python is not that difficult, you see. Let me know what you think. Vaclav _______________________________________________ Mailing list: https://launchpad.net/~yade-dev Post to : [email protected] Unsubscribe : https://launchpad.net/~yade-dev More help : https://help.launchpad.net/ListHelp
