[357fba] | 1 | /*
|
---|
| 2 | * linkedcell.hpp
|
---|
| 3 | *
|
---|
| 4 | * If the linked cell should be usable, the class has to inherit LCNodeSet and the nodes (containing the Vectors) have to inherit LCNode. This works well
|
---|
| 5 | * for molecule and atom classes.
|
---|
| 6 | *
|
---|
| 7 | * Created on: Aug 3, 2009
|
---|
| 8 | * Author: heber
|
---|
| 9 | */
|
---|
| 10 |
|
---|
[e1bc68] | 11 | #ifndef LINKEDCELL_HPP_
|
---|
| 12 | #define LINKEDCELL_HPP_
|
---|
| 13 |
|
---|
[357fba] | 14 | using namespace std;
|
---|
| 15 |
|
---|
[f66195] | 16 | /*********************************************** includes ***********************************/
|
---|
| 17 |
|
---|
[e1bc68] | 18 | // include config.h
|
---|
| 19 | #ifdef HAVE_CONFIG_H
|
---|
| 20 | #include <config.h>
|
---|
| 21 | #endif
|
---|
| 22 |
|
---|
[357fba] | 23 | #include <list>
|
---|
[af2c424] | 24 | #include <vector>
|
---|
| 25 | #include <map>
|
---|
[357fba] | 26 |
|
---|
[3738f0] | 27 | //#include "CodePatterns/Assert.hpp"
|
---|
| 28 | //#include "CodePatterns/Log.hpp"
|
---|
| 29 | //#include "CodePatterns/Verbose.hpp"
|
---|
[e4fe8d] | 30 | #include "Helpers/defs.hpp"
|
---|
[57f243] | 31 | #include "LinearAlgebra/Vector.hpp"
|
---|
[34c43a] | 32 | #include "World.hpp"
|
---|
[357fba] | 33 |
|
---|
[f66195] | 34 | /****************************************** forward declarations *****************************/
|
---|
| 35 |
|
---|
[34c43a] | 36 | class IPointCloud;
|
---|
[f66195] | 37 | class TesselPoint;
|
---|
| 38 |
|
---|
| 39 | /********************************************** definitions *********************************/
|
---|
[e1bc68] | 40 |
|
---|
[c66537] | 41 | //< Upper bound for number of cell nodes used in sensibility check on allocation.
|
---|
| 42 | enum { MAX_LINKEDCELLNODES = 1000000 };
|
---|
[6ac7ee] | 43 |
|
---|
[f66195] | 44 | /********************************************** declarations *******************************/
|
---|
| 45 |
|
---|
[34c43a] | 46 | typedef std::list<TesselPoint *> TesselPointSTLList;
|
---|
| 47 |
|
---|
[357fba] | 48 | /** Linked Cell class for containing Vectors in real space efficiently.
|
---|
| 49 | */
|
---|
| 50 | class LinkedCell {
|
---|
[734816] | 51 | private:
|
---|
| 52 |
|
---|
| 53 | public:
|
---|
[042f82] | 54 | Vector max; // upper boundary
|
---|
| 55 | Vector min; // lower boundary
|
---|
[34c43a] | 56 | TesselPointSTLList *LC; // linked cell list
|
---|
[042f82] | 57 | double RADIUS; // cell edge length
|
---|
| 58 | int N[NDIM]; // number of cells per axis
|
---|
[776b64] | 59 | mutable int n[NDIM]; // temporary variable for current cell per axis
|
---|
| 60 | mutable int index; // temporary index variable , access by index = n[0] * N[1] * N[2] + n[1] * N[2] + n[2];
|
---|
[6ac7ee] | 61 |
|
---|
[042f82] | 62 | LinkedCell();
|
---|
[34c43a] | 63 | LinkedCell(IPointCloud &set, const double radius);
|
---|
[042f82] | 64 | ~LinkedCell();
|
---|
[34c43a] | 65 | const TesselPointSTLList* GetCurrentCell()const ;
|
---|
| 66 | const TesselPointSTLList* GetRelativeToCurrentCell(const int relative[NDIM])const ;
|
---|
[776b64] | 67 | bool SetIndexToNode(const TesselPoint * const Walker)const ;
|
---|
[d74077] | 68 | bool SetIndexToVector(const Vector &x)const ;
|
---|
[ffe885] | 69 | double SetClosestIndexToOutsideVector(const Vector * const x) const;
|
---|
[776b64] | 70 | bool CheckBounds()const ;
|
---|
| 71 | bool CheckBounds(const int relative[NDIM])const ;
|
---|
[893bea] | 72 | void GetNeighbourBounds(int lower[NDIM], int upper[NDIM], int step = 1)const ;
|
---|
[6ac7ee] | 73 |
|
---|
[34c43a] | 74 | TesselPointSTLList* GetallNeighbours(const double distance = 0) const;
|
---|
| 75 | TesselPointSTLList* GetPointsInsideSphere(const double radius, const Vector * const center) const;
|
---|
[042f82] | 76 | // not implemented yet
|
---|
[357fba] | 77 | bool AddNode(Vector *Walker);
|
---|
| 78 | bool DeleteNode(Vector *Walker);
|
---|
| 79 | bool MoveNode(Vector *Walker);
|
---|
[e1bc68] | 80 | };
|
---|
| 81 |
|
---|
| 82 | #endif /*LINKEDCELL_HPP_*/
|
---|