# How to use the Spatial Search Algorithm

(Difference between revisions)
 Revision as of 13:00, 4 May 2012 (view source)Nelson (Talk | contribs) (→An Exemple Configure File)← Older edit Revision as of 13:03, 4 May 2012 (view source)Nelson (Talk | contribs) (→An Exemple Configure File)Newer edit → Line 48: Line 48: − #if !defined(KRATOS_DISCRETE_PARTICLE__CONFIGURE_INCLUDED) + * Change the name of directives − #define  KRATOS_DISCRETE_PARTICLE__CONFIGURE_INCLUDED + #if !defined(KRATOS_DISCRETE_PARTICLE__CONFIGURE_INCLUDED) − + #define  KRATOS_DISCRETE_PARTICLE__CONFIGURE_INCLUDED − + − + − // System includes + − #include + − #include + − #include + − + − + − namespace Kratos + − { + − + − ///@name Kratos Globals + − ///@{ + − + − ///@} + − ///@name Type Definitions + − ///@{ + − + − ///@} + − ///@name  Enum's + − ///@{ + − + − ///@} + − ///@name  Functions + − ///@{ + + *Change the name of class ///@} ///@} ///@name Kratos Classes ///@name Kratos Classes ///@{ ///@{ − − template template class DiscreteParticleConfigure{ class DiscreteParticleConfigure{

## 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

It say that is the main file created by the user, which defines the types, and operations contenerdores necessary to make the spatial decomposition and the search for contacts. Is then the parameter that defines Bins.

This consists of four parts:

• Definition of the types and their containers.
• Function that calculates bounding box
• Function of intersection between objects
• Function of intercession between the object and cells.

## An Exemple Configure File

Supose that we have a set of discrete elements like a speheres. In our file called "discrete_configure_file.h" need to create the class, types and methods before mentioned. Is useful to create this file using the template of Kratos found in kratos/templates directory. Only we need to do is changes the default names and directives by the name of our file. Normaly this file is stored in the custom_utilities directory of the application.

• Change the name of directives
``` #if !defined(KRATOS_DISCRETE_PARTICLE__CONFIGURE_INCLUDED)
#define  KRATOS_DISCRETE_PARTICLE__CONFIGURE_INCLUDED
```
• Change the name of class
``` ///@}
///@name Kratos Classes
///@{
```

template <std::size_t TDimension> class DiscreteParticleConfigure{ public:

 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