/usr/include/vtk-6.2/vtkAMRBox.h is in libvtk6-dev 6.2.0+dfsg1-10build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 | /*=========================================================================
Program: Visualization Toolkit
Module: vtkAMRBox.h
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
// .NAME vtkAMRBox - Encloses a rectangular region of voxel like cells.
//
// .SECTION Description
// vtkAMRBox stores information for an AMR block
//
// .SECTION See Also
// vtkAMRInformation
#ifndef vtkAMRBox_h
#define vtkAMRBox_h
#include "vtkCommonDataModelModule.h" // For export macro
#include "vtkObject.h"
#include "vtkStructuredData.h" // For VTK_XYZ_GRID definition
class VTKCOMMONDATAMODEL_EXPORT vtkAMRBox
{
public:
// Description:
// Construct the empty box.
vtkAMRBox();
// Description:
// Copy construct this box from another.
vtkAMRBox(const vtkAMRBox &other);
// Description:
// Construct a specific 3D box.
vtkAMRBox(
int ilo,int jlo,int klo,
int ihi,int jhi,int khi);
// Description:
// Construct a specific 2D box in the XY plane.
vtkAMRBox(
int ilo,int jlo,
int ihi,int jhi);
// Description
// Construct an AMR box from the description a vtkUniformGrid
// Note that the dimensions specify the node dimensions, rather than the cell dimensions
vtkAMRBox(const double* origin, const int* dimensions, const double* spacing,
const double* globalOrigin, int gridDescription=VTK_XYZ_GRID);
// Description:
// Construct a specific box. (ilo,jlo,klo,)(ihi,jhi,khi)
vtkAMRBox(const int lo[3], const int hi[3]);
vtkAMRBox(const int dims[6]);
// Description:
// Copy the other box to this box.
vtkAMRBox &operator=(const vtkAMRBox &other);
virtual ~vtkAMRBox(){}
// Description:
// Set the box to be invalid;
void Invalidate()
{
this->LoCorner[0]=this->LoCorner[1]=this->LoCorner[2]=0;
this->HiCorner[0]=this->HiCorner[1]=this->HiCorner[2]=-2;
}
// Description:
// Whether dimension i is empty, e.g. if the data set is type VTK_XY_PLANE
bool EmptyDimension(int i) const{ return HiCorner[i]<=LoCorner[i]-1;}
// Description:
// Set the dimensions of the box. ilo,jlo,klo,ihi,jhi,khi
void SetDimensions(
int ilo, int jlo, int klo,
int ihi, int jhi, int khi, int desc=VTK_XYZ_GRID);
// Description:
// Set the dimensions of the box. (ilo,jlo,klo),(ihi,jhi,khi)
void SetDimensions(const int lo[3], const int hi[3], int desc=VTK_XYZ_GRID);
// Description:
// Set the dimensions of the box. (ilo,ihi,jlo,jhi,klo,khi)
void SetDimensions(const int dims[6], int desc = VTK_XYZ_GRID);
// Description:
// Get the dimensions of this box. (ilo,jlo,jhi),(ihi,jhi,khi)
void GetDimensions(int lo[3], int hi[3]) const;
// Description:
// Get the dimensions of this box. (ilo,ihi, jlo,jhi, klo,khi)
void GetDimensions(int dims[6]) const;
// Description:
// Gets the number of cells enclosed by the box.
vtkIdType GetNumberOfCells() const;
void GetNumberOfCells(int num[3]) const;
// Description:
// Gets the number of nodes required to construct
// a physical representation of the box.
void GetNumberOfNodes(int ext[3]) const;
vtkIdType GetNumberOfNodes() const;
// Description:
// Determines the dimension of the AMR box given the
// box indices. Note, the AMR box can be on an arbitrary
// axis-aligned plane, i.e., XZ or YZ.
int ComputeDimension() const;
// Description:
// Get the low corner index.
const int *GetLoCorner() const { return this->LoCorner; }
const int *GetHiCorner() const { return this->HiCorner; }
// Description:
// Return a high corner. If dimension j is empty,
// then hi[j] is set from lo[j]. This is convenient
// For algorithm that must iterate over all cells
void GetValidHiCorner(int hi[3]) const;
bool Empty() const
{return this->IsInvalid();}
// Description:
// Check to see if the AMR box instance is invalid.
bool IsInvalid() const
{
return ((this->HiCorner[0] < this->LoCorner[0]-1) ||
(this->HiCorner[1] < this->LoCorner[1]-1) ||
(this->HiCorner[2] < this->LoCorner[2]-1));
}
// Description:
// Test if this box is equal with the box instance on the rhs.
// Note: Two AMR boxes are equal if: (a) they have the same dimensionality
// (b) they are at the same level and (c) they occupy the same index space.
bool operator==(const vtkAMRBox &other) const;
// Description:
// Test if this box is NOT equal with the box instance on the rhs.
// Note: Two AMR boxes are equal if: (a) they have the same dimensionality
// (b) they are at the same level and (c) they occupy the same index space.
bool operator!=(const vtkAMRBox &other) const
{ return( !(*this == other) ); }
// Description:
// Send the box to a stream. "(ilo,jlo,jhi),(ihi,jhi,khi)"
ostream &Print(ostream &os) const;
// Description:
// Serializes this object instance into a byte-stream.
// buffer -- user-supplied pointer where the serialized object is stored.
// bytesize -- number of bytes, i.e., the size of the buffer.
// NOTE: buffer is allocated internally by this method.
// Pre-conditions:
// buffer == NULL
// Post-conditions:
// buffer != NULL
// bytesize != 0
void Serialize( unsigned char*& buffer, vtkIdType &bytesize );
void Serialize(int* buffer) const;
// Description:
// Deserializes this object instance from the given byte-stream.
// Pre-conditions:
// buffer != NULL
// bytesize != 0
void Deserialize( unsigned char* buffer, const vtkIdType &bytesize );
// Description:
// Checks if this instance of vtkAMRBox intersects with the box passed through
// the argument list along the given dimension q. True is returned iff the box
// intersects successfully. Otherwise, there is no intersection along the
// given dimension and false is returned.
bool DoesBoxIntersectAlongDimension(const vtkAMRBox &other, const int q) const;
bool DoesIntersect(const vtkAMRBox &other) const;
// Description:
// Coarsen the box.
void Coarsen(int r);
// Description:
// Refine the box.
void Refine(int r);
// Description:
// Grows the box in all directions.
void Grow(int byN);
void Shrink(int byN);
// Description:
// Shifts the box in index space
void Shift(int i, int j, int k);
void Shift(const int I[3]);
// Description:
// Intersect this box with another box in place. Returns
// true if the boxes do intersect. Note that the box is
// modified to be the intersection or is made invalid.
bool Intersect(const vtkAMRBox &other);
// Description:
// Test to see if a given cell index is inside this box.
bool Contains(int i,int j,int k) const;
bool Contains(const int I[3]) const;
// Description:
// Test to see if a given box is inside this box.
bool Contains(const vtkAMRBox&) const;
// Description:
// Given an AMR box and the refinement ratio, r, this method computes the
// number of ghost layers in each of the 6 directions, i.e.,
// [imin,imax,jmin,jmax,kmin,kmax]
void GetGhostVector(int r, int nghost[6]) const;
// Description:
// Given an AMR box and the refinement ratio, r, this shrinks
// the AMRBox
void RemoveGhosts(int r);
public:
// Description:
// Returns the number of bytes allocated by this instance. In addition,
// this number of bytes corresponds to the buffer size required to serialize
// any vtkAMRBox instance.
static vtkIdType GetBytesize(){return 6*sizeof(int); };
// Description:
// Returns the linear index of the given cell structured coordinates
static int GetCellLinearIndex(const vtkAMRBox& box, const int i, const int j, const int k, int imageDimension[3] );
// Description:
// Get the bounds of this box.
static void GetBounds(const vtkAMRBox& box, const double origin[3], const double spacing[3],double bounds[6]) ;
// Description:
// Get the world space origin of this box. The origin is the
// location of the lower corner cell's lower corner node,
static void GetBoxOrigin(const vtkAMRBox& box, const double X0[3], const double spacing[3],double x0[3]);
// Description:
// Checks if the point is inside this AMRBox instance.
// x,y,z the world point
static bool HasPoint(const vtkAMRBox& box, const double origin[3], const double spacing[3], double x, double y, double z );
// Description
//Compute structured coordinates
static int ComputeStructuredCoordinates(const vtkAMRBox& box, const double dataOrigin[3],
const double h[3], const double x[3], int ijk[3], double pcoords[3]);
protected:
// Description:
// Initializes this box instance.
void Initialize( );
// Description:
// Intersects this instance of vtkAMRbox with box passed through the argument
// list along the given dimension q. True is returned iff the box intersects
// successfully. Otherwise, false is returned if there is no intersection at
// the given dimension.
bool IntersectBoxAlongDimension(const vtkAMRBox &other, const int q);
private:
int LoCorner[3]; // lo corner cell id.
int HiCorner[3]; // hi corner cell id.
// Description:
// This method builds the AMR box with the given dimensions.
// Note: the dimension of the AMR box is automatically detected
// within this method.
void BuildAMRBox(
const int ilo, const int jlo, const int klo,
const int ihi, const int jhi, const int khi );
};
//*****************************************************************************
// Description:
// Fill the region of "pArray" enclosed by "destRegion" with "fillValue"
// "pArray" is defined on "arrayRegion".
template <typename T>
void FillRegion(
T *pArray,
const vtkAMRBox &arrayRegion,
const vtkAMRBox &destRegion,
T fillValue)
{
// Convert regions to array index space. VTK arrays
// always start with 0,0,0.
int ofs[3];
ofs[0]=-arrayRegion.GetLoCorner()[0];
ofs[1]=-arrayRegion.GetLoCorner()[1];
ofs[2]=-arrayRegion.GetLoCorner()[2];
vtkAMRBox arrayDims(arrayRegion);
arrayDims.Shift(ofs);
vtkAMRBox destDims(destRegion);
destDims.Shift(ofs);
// Quick sanity check.
if (!arrayRegion.Contains(destRegion))
{
vtkGenericWarningMacro(
<< "ERROR: Array must enclose the destination region. "
<< "Aborting the fill.");
}
// Get the bounds of the indices we fill.
const int* destLo = destDims.GetLoCorner();
int destHi[3];
destDims.GetValidHiCorner(destHi);
// Get the array dimensions.
int arrayHi[3];
arrayDims.GetNumberOfCells(arrayHi);
// Fill.
for (int k=destLo[2]; k<=destHi[2]; ++k)
{
vtkIdType kOfs=k*arrayHi[0]*arrayHi[1];
for (int j=destLo[1]; j<=destHi[1]; ++j)
{
vtkIdType idx=kOfs+j*arrayHi[0]+destLo[0];
for (int i=destLo[0]; i<=destHi[0]; ++i)
{
pArray[idx]=fillValue;
++idx;
}
}
}
}
#endif
// VTK-HeaderTest-Exclude: vtkAMRBox.h
|