# How to use the Spatial Search Algorithm

(Difference between revisions)
 Revision as of 11:59, 4 May 2012 (view source)Nelson (Talk | contribs) (→Using the Spatial Search Algorithm)← Older edit Revision as of 12:26, 4 May 2012 (view source)Nelson (Talk | contribs) (→Using the Spatial Search Algorithm)Newer edit → Line 4: Line 4: Combined Finite-Discrete Element Method simulations involve contact of a large number Combined Finite-Discrete Element Method simulations involve contact of a large number of separate bodies. Processing contact interaction for all possible contacts would involve of separate bodies. Processing contact interaction for all possible contacts would involve − a total number of operations proportional to N2, where N is the total number of separates bodies + a total number of operations proportional to N^2, where N is the total number of separates bodies comprising the problem. comprising the problem. Line 10: Line 10: This would be very CPU intensive, and would limit the application that use and need to evaluate This would be very CPU intensive, and would limit the application that use and need to evaluate the contact forces ,comprising a very small number (a few thousand) of separates bodies. the contact forces ,comprising a very small number (a few thousand) of separates bodies. − To reduce CPU requirements of processing contact interaction, it is necessary to eliminate couples of discrete elements that are far from each other and are not in contact. A set of combined finite-discrete element procedures designed to detect + To reduce CPU requirements of processing contact interaction, it is necessary to eliminate couples of discrete elements that are far from each other and are not in contact. A set procedures designed to detect − discrete or finite elements that are close to each other is usually called a contact detection + bodies that are close to each other is usually called a contact detection algorithm, or sometimes a contact search algorithm. algorithm, or sometimes a contact search algorithm. + With this purpose was created in Kratos Program  a contact search algorithm based on spatial decomposition, + so it can be used for any application and is unique in that it was implemented in a generic way. + Therefore it requires a contact search algorithm having the following characteristics: + + *Robust, + *CPU efficient, + *RAM efficient + + == The User Configure File == {{Warning| {{Warning|

## Using the Spatial Search Algorithm

Large-scale in Finite Element Methods, Discrete Element Method and Combined Finite-Discrete Element Method simulations involve contact of a large number of separate bodies. Processing contact interaction for all possible contacts would involve a total number of operations proportional to N^2, where N is the total number of separates bodies comprising the problem.

This would be very CPU intensive, and would limit the application that use and need to evaluate the contact forces ,comprising a very small number (a few thousand) of separates bodies. To reduce CPU requirements of processing contact interaction, it is necessary to eliminate couples of discrete elements that are far from each other and are not in contact. A set procedures designed to detect bodies that are close to each other is usually called a contact detection algorithm, or sometimes a contact search algorithm.

With this purpose was created in Kratos Program a contact search algorithm based on spatial decomposition, so it can be used for any application and is unique in that it was implemented in a generic way. Therefore it requires a contact search algorithm having the following characteristics:

• Robust,
• CPU efficient,
• RAM efficient

## The User Configure File

 Warning. Please, note that: Saving the name of the class IS NOT NECESSARY anymore. please remove it from the old codes because it will prevent them to be serialized.

## References

• ﻿ Munjiza. Ante, The Combined Finite-Discrete Element Method, John Wiley & Sons, Ltd. 2004