| 1 | /* | 
|---|
| 2 | * Box.hpp | 
|---|
| 3 | * | 
|---|
| 4 | *  Created on: Jun 30, 2010 | 
|---|
| 5 | *      Author: crueger | 
|---|
| 6 | */ | 
|---|
| 7 |  | 
|---|
| 8 | #ifndef BOX_HPP_ | 
|---|
| 9 | #define BOX_HPP_ | 
|---|
| 10 |  | 
|---|
| 11 | class Matrix; | 
|---|
| 12 | class Vector; | 
|---|
| 13 | class Shape; | 
|---|
| 14 |  | 
|---|
| 15 | #include <list> | 
|---|
| 16 | #include "VectorSet.hpp" | 
|---|
| 17 |  | 
|---|
| 18 | /** | 
|---|
| 19 | * A simple class that can be used to store periodic Boxes | 
|---|
| 20 | * in the form of a parallelepiped. | 
|---|
| 21 | * | 
|---|
| 22 | * Stores a matrix that can be used to translate from periodic | 
|---|
| 23 | * [0,1) space as well as the inverse that is needed to | 
|---|
| 24 | * translate back to that space. | 
|---|
| 25 | */ | 
|---|
| 26 | class Box | 
|---|
| 27 | { | 
|---|
| 28 | public: | 
|---|
| 29 | Box(); | 
|---|
| 30 | Box(const Box&); | 
|---|
| 31 | virtual ~Box(); | 
|---|
| 32 |  | 
|---|
| 33 | /** | 
|---|
| 34 | * Get the matrix describing the form of the parallelepiped | 
|---|
| 35 | */ | 
|---|
| 36 | const Matrix &getM() const; | 
|---|
| 37 |  | 
|---|
| 38 | /** | 
|---|
| 39 | * Get the inverse of the matrix M (see above). | 
|---|
| 40 | */ | 
|---|
| 41 | const Matrix &getMinv() const; | 
|---|
| 42 |  | 
|---|
| 43 | /** | 
|---|
| 44 | * Set the form of the parallelepiped. | 
|---|
| 45 | */ | 
|---|
| 46 | void setM(Matrix); | 
|---|
| 47 |  | 
|---|
| 48 | Box &operator=(const Box&); | 
|---|
| 49 | Box &operator=(const Matrix&); | 
|---|
| 50 |  | 
|---|
| 51 | /** | 
|---|
| 52 | * Translate a point from [0,1) to the boxed space. | 
|---|
| 53 | */ | 
|---|
| 54 | Vector translateIn(const Vector &point) const; | 
|---|
| 55 |  | 
|---|
| 56 | /** | 
|---|
| 57 | * Translate a point from the boxed space to the [0,1) space. | 
|---|
| 58 | */ | 
|---|
| 59 | Vector translateOut(const Vector &point) const; | 
|---|
| 60 |  | 
|---|
| 61 | /** | 
|---|
| 62 | * Wrap a point so that it will lie within the space defined by the box. | 
|---|
| 63 | */ | 
|---|
| 64 | Vector WrapPeriodically(const Vector &point) const; | 
|---|
| 65 |  | 
|---|
| 66 | /** | 
|---|
| 67 | * Produce corresponding points in several adjacent boxes. | 
|---|
| 68 | * | 
|---|
| 69 | * n specifies the number of times the point is expanded. | 
|---|
| 70 | * Carefull, needs O(n^3) time and produces as many vectors. | 
|---|
| 71 | */ | 
|---|
| 72 | VECTORSET(std::list) explode(const Vector &point,int n) const; | 
|---|
| 73 | VECTORSET(std::list) explode(const Vector &point) const; | 
|---|
| 74 |  | 
|---|
| 75 | /** | 
|---|
| 76 | * Calculate the distance of two points in the periodic space | 
|---|
| 77 | * defined by this box | 
|---|
| 78 | */ | 
|---|
| 79 | double periodicDistanceSquared(const Vector &point1,const Vector &point2) const; | 
|---|
| 80 |  | 
|---|
| 81 | /** | 
|---|
| 82 | * Calculate the distance of two points in the periodic space | 
|---|
| 83 | * defined by this box | 
|---|
| 84 | */ | 
|---|
| 85 | double periodicDistance(const Vector &point1,const Vector &point2) const; | 
|---|
| 86 |  | 
|---|
| 87 | Shape getShape() const; | 
|---|
| 88 |  | 
|---|
| 89 | private: | 
|---|
| 90 | Matrix *M;    //!< Defines the layout of the box | 
|---|
| 91 | Matrix *Minv; //!< Inverse of M to avoid recomputation | 
|---|
| 92 | }; | 
|---|
| 93 |  | 
|---|
| 94 | #endif /* BOX_HPP_ */ | 
|---|