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