Hello, 1. especially about FEM interface I am very interested :-)
4. I was also thinking aboud NBS (No Binary Search) contact detection algorithm, that has linear complexity, but my programmer's skills are not yet sufficient for this task.. Jan ______________________________________________________________ > Od: "Chiara Modenese" <[email protected]> > Komu: [email protected] > Datum: 02.02.2011 00:04 > Předmět: Re: [Yade-dev] Google Summer of Code 2011 > >> >> 1. integration with oofem.org (or other FEM code; I mention this >> specifically for Jan who might be interested), to have a decent and flexible >> FEM interface. That would be for sure full-time work for 3 months which >> would be very useful. >> >> 2. MPI subdomains and parallelization; highly challenging, breaking all the >> rest of the code, for real geeks. >> >> 3. General composed particles and their interactions (such as triangulated >> surfaces with continuous contacts accross triangles). >> > > >Hi V., > >very good idea! I would add something to the list, I am sure everyone would >really benefit from it. > >4. Improvement of the speed of the contact detection method. Ideally, a grid >method would be implemented. > >We really miss the above point in Yade, it would be simply great to have it! >Cheers, Chiara > >> >> _______________________________________________ >> Mailing list: >> https://launchpad.net/~yade-dev<https://launchpad.net/%7Eyade-dev> >> Post to : [email protected] >> Unsubscribe : >> https://launchpad.net/~yade-dev<https://launchpad.net/%7Eyade-dev> >> More help : https://help.launchpad.net/ListHelp >> > >_______________________________________________ >Mailing list: https://launchpad.net/~yade-dev >Post to : [email protected] >Unsubscribe : https://launchpad.net/~yade-dev >More help : https://help.launchpad.net/ListHelp > > _______________________________________________ Mailing list: https://launchpad.net/~yade-dev Post to : [email protected] Unsubscribe : https://launchpad.net/~yade-dev More help : https://help.launchpad.net/ListHelp
