vtkAMRBox.h File Reference

#include "vtkObject.h"
#include "vtkType.h"
#include <vtkstd/vector>

Include dependency graph for vtkAMRBox.h:

Go to the source code of this file.

Classes
class	vtkAMRBox
	Encloses a rectangular region of voxel like cells. More...
struct	vtkAMRBoxInitializeHelp< dimension >

Functions
template<int dimension>
void	vtkAMRBoxInitialize (int *LoCorner, int *HiCorner, const int *loCorner, const int *hiCorner, vtkAMRBoxInitializeHelp< dimension > *=0)
void	Split (const int N[3], const int minSide[3], vtkstd::vector< vtkAMRBox > &decomp)
void	Split (const int minSide[3], vtkstd::vector< vtkAMRBox > &decomp)
template<typename T >
void	FillRegion (T *pArray, const vtkAMRBox &arrayRegion, const vtkAMRBox &destRegion, T fillValue)

Function Documentation

template<int dimension>

void vtkAMRBoxInitialize	(	int *	LoCorner,
		int *	HiCorner,
		const int *	loCorner,
		const int *	hiCorner,
		vtkAMRBoxInitializeHelp< dimension > *	= 0
	)

Definition at line 232 of file vtkAMRBox.h.

template<typename T >

void FillRegion	(	T *	pArray,
		const vtkAMRBox &	arrayRegion,
		const vtkAMRBox &	destRegion,
		T	fillValue
	)

Fill the region of "pArray" enclosed by "destRegion" with "fillValue" "pArray" is defined on "arrayRegion".

Definition at line 256 of file vtkAMRBox.h.

void Split	(	const int	N[3],
		const int	minSide[3],
		vtkstd::vector< vtkAMRBox > &	decomp
	)

Split the boxes passed in N times in the i,j and k directions. Once a box is split down to a single cell, or the given minimum side length it won't be split anymore, but it will propagate through the operation.

void Split	(	const int	minSide[3],
		vtkstd::vector< vtkAMRBox > &	decomp
	)

Split the boxes passed in in the i,j and k directions, until splitting operation would result boxes with side lengths less than the specified minimum or the box is split down to a single cell..