IBAMR
An adaptive and distributed-memory parallel implementation of the immersed boundary (IB) method
|
Class PartitioningBox implements an NDIM-dimensional bounding box defined by two points. Unlike a standard bounding box, a PartitioningBox is an NDIM
-dimensional tensor product of half-open intervals: i.e., it is a half-open box. This property allows one to partition a domain into a set of boxes.
More...
#include </home/runner/work/IBAMR/IBAMR/ibtk/include/ibtk/PartitioningBox.h>
Public Member Functions | |
PartitioningBox () | |
Default Constructor: an 'empty' partitioning box. | |
PartitioningBox (const Point &bottom_point, const Point &top_point) | |
Constructor. | |
PartitioningBox (const SAMRAI::geom::CartesianPatchGeometry< NDIM > &patch) | |
Constructor, starting from a SAMRAI data type. | |
const Point & | bottom () const |
Get the bottom left corner of the box. | |
const Point & | top () const |
bool | contains (const Point &point) const |
Return true if the point is inside the box and false otherwise. | |
double | volume () const |
Return the volume of the box. If the box is empty then this is zero. | |
Protected Attributes | |
std::pair< Point, Point > | d_bounding_points |
bottom left and top right corners of the bounding box. | |
Class PartitioningBox implements an NDIM-dimensional bounding box defined by two points. Unlike a standard bounding box, a PartitioningBox is an NDIM
-dimensional tensor product of half-open intervals: i.e., it is a half-open box. This property allows one to partition a domain into a set of boxes.
It is possible for a partitioning box to be 'empty': in that case the bounds are [oo, oo) in each dimension.
|
inline |
Get the top right corner of the box. Note that this point is not in the box.