[83c09a] | 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 |
|
---|
[3dcb1f] | 11 | class Matrix;
|
---|
| 12 | class Vector;
|
---|
[83c09a] | 13 |
|
---|
[89e820] | 14 | #include <list>
|
---|
| 15 | #include "VectorSet.hpp"
|
---|
| 16 |
|
---|
[abd8f7] | 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 | */
|
---|
[83c09a] | 25 | class Box
|
---|
| 26 | {
|
---|
| 27 | public:
|
---|
| 28 | Box();
|
---|
[7579a4b] | 29 | Box(const Box&);
|
---|
[83c09a] | 30 | virtual ~Box();
|
---|
| 31 |
|
---|
[abd8f7] | 32 | /**
|
---|
| 33 | * Get the matrix describing the form of the parallelepiped
|
---|
| 34 | */
|
---|
[7579a4b] | 35 | const Matrix &getM() const;
|
---|
[abd8f7] | 36 |
|
---|
| 37 | /**
|
---|
| 38 | * Get the inverse of the matrix M (see above).
|
---|
| 39 | */
|
---|
[7579a4b] | 40 | const Matrix &getMinv() const;
|
---|
[abd8f7] | 41 |
|
---|
| 42 | /**
|
---|
| 43 | * Set the form of the parallelepiped.
|
---|
| 44 | */
|
---|
[83c09a] | 45 | void setM(Matrix);
|
---|
[7579a4b] | 46 |
|
---|
| 47 | Box &operator=(const Box&);
|
---|
| 48 | Box &operator=(const Matrix&);
|
---|
| 49 |
|
---|
[abd8f7] | 50 | /**
|
---|
| 51 | * Translate a point from [0,1) to the boxed space.
|
---|
| 52 | */
|
---|
[014475] | 53 | Vector translateIn(const Vector &point) const;
|
---|
[abd8f7] | 54 |
|
---|
| 55 | /**
|
---|
| 56 | * Translate a point from the boxed space to the [0,1) space.
|
---|
| 57 | */
|
---|
[014475] | 58 | Vector translateOut(const Vector &point) const;
|
---|
[3dcb1f] | 59 |
|
---|
[abd8f7] | 60 | /**
|
---|
| 61 | * Wrap a point so that it will lie within the space defined by the box.
|
---|
| 62 | */
|
---|
[014475] | 63 | Vector WrapPeriodically(const Vector &point) const;
|
---|
[abd8f7] | 64 |
|
---|
[0ff6b5] | 65 | /**
|
---|
| 66 | * Checks whether a given vector is inside the box.
|
---|
| 67 | */
|
---|
| 68 | bool isInside(const Vector &point) const;
|
---|
| 69 |
|
---|
[abd8f7] | 70 | /**
|
---|
| 71 | * Produce corresponding points in several adjacent boxes.
|
---|
[a630fd] | 72 | *
|
---|
| 73 | * n specifies the number of times the point is expanded.
|
---|
| 74 | * Carefull, needs O(n^3) time and produces as many vectors.
|
---|
[abd8f7] | 75 | */
|
---|
[7ac4af] | 76 | VECTORSET(std::list) explode(const Vector &point,int n) const;
|
---|
| 77 | VECTORSET(std::list) explode(const Vector &point) const;
|
---|
[527de2] | 78 |
|
---|
[abd8f7] | 79 | /**
|
---|
| 80 | * Calculate the distance of two points in the periodic space
|
---|
| 81 | * defined by this box
|
---|
| 82 | */
|
---|
[014475] | 83 | double periodicDistanceSquared(const Vector &point1,const Vector &point2) const;
|
---|
[abd8f7] | 84 |
|
---|
| 85 | /**
|
---|
| 86 | * Calculate the distance of two points in the periodic space
|
---|
| 87 | * defined by this box
|
---|
| 88 | */
|
---|
[014475] | 89 | double periodicDistance(const Vector &point1,const Vector &point2) const;
|
---|
[f429d7] | 90 |
|
---|
[83c09a] | 91 | private:
|
---|
| 92 | Matrix *M; //!< Defines the layout of the box
|
---|
| 93 | Matrix *Minv; //!< Inverse of M to avoid recomputation
|
---|
| 94 | };
|
---|
| 95 |
|
---|
| 96 | #endif /* BOX_HPP_ */
|
---|