A comparison of data structures for the simulation of polydisperse particle packings (Q3018004): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An algorithm to generate random dense arrangements for discrete element simulations of granular assemblies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance comparisons of tree‐based and cell‐based contact detection algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A contact algorithm for partitioning <i>N</i> arbitrary sized objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmented spatial digital tree algorithm for contact detection in computational mechanics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996938 / rank
 
Normal rank

Latest revision as of 08:04, 4 July 2024

scientific article
Language Label Description Also known as
English
A comparison of data structures for the simulation of polydisperse particle packings
scientific article

    Statements

    A comparison of data structures for the simulation of polydisperse particle packings (English)
    0 references
    0 references
    0 references
    0 references
    20 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    sphere packing
    0 references
    polydisperse
    0 references
    data structure
    0 references
    spatial index
    0 references
    loose octree
    0 references
    Verlet list
    0 references
    0 references