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 <ibtk/PartitioningBox.h>
It is possible for a partitioning box to be 'empty': in that case the bounds are [oo, oo) in each dimension.
◆ PartitioningBox() [1/3]
| IBTK::PartitioningBox::PartitioningBox |
( |
| ) |
|
◆ PartitioningBox() [2/3]
| IBTK::PartitioningBox::PartitioningBox |
( |
const Point & |
bottom_point, |
|
|
const Point & |
top_point |
|
) |
| |
◆ PartitioningBox() [3/3]
◆ bottom()
| const Point & IBTK::PartitioningBox::bottom |
( |
| ) |
const |
|
inline |
◆ top()
| const Point & IBTK::PartitioningBox::top |
( |
| ) |
const |
|
inline |
Get the top right corner of the box. Note that this point is not in the box.
◆ contains()
| bool IBTK::PartitioningBox::contains |
( |
const Point & |
point | ) |
const |
|
inline |
◆ volume()
| double IBTK::PartitioningBox::volume |
( |
| ) |
const |
◆ d_bounding_points
| std::pair<Point, Point> IBTK::PartitioningBox::d_bounding_points |
|
protected |
The documentation for this class was generated from the following files: