← Back to team overview

yade-users team mailing list archive

Re: R: Re: Contact detection

 

Contact detection in SDEC was based on a grid: each particle was attributed to a case of the grid and only particles belonging to neighbouring cases were checked to be or not in contact. The size of the grid was fitted from the biggest element, thus the velocity of the detection was dependent on the gradding of the granular assembly.

After it is difficult to say if SDEC was slower or faster than Yade, I tried to make comparisons but it was on different computers, so it is not very meaningful! Please keep in mind that SDEC and Yade are made with different objectives. It was not very easy in SDEC to make modifications without change the core of the code, whereas evolutions and complementary packages can be easly introduced in Yade, and everybody can take advantage of developments made by others. With Jean-Patrick, we made developments in SDEC during more than three years, now all those developments are in the garbage because SDEC was not open-ended...

Luc

Janek Kozicki a écrit :
Václav Šmilauer said:     (by the date of Mon, 16 Nov 2009 09:46:52 +0100)

In another words, Olivier (and you) didn't bother to google out articles
on that and thought he was the smartest guy.
yeah. That time there was a LOT of other stuff to bother about, than
colliders :) Paint me ashamed ;>
I am not saying you are to be blamed, but Frederic, as supervisor of the
project, should have managed that.

I recall his point of view: SDEC has a lot slower collider (IIRC:
it was "check everything with everything"?. Some SDEC user could tell
us). And so Frederic was very happy to see how much faster SAP is :)


--
Luc Sibille

Université de Nantes - Laboratoire GeM UMR CNRS

IUT de Saint Nazaire
58, rue Michel-Ange - BP 420
44606 Saint-Nazaire Cedex, France

Tel: +33 (0)2 40 17 81 78



Follow ups

References