NAME
vtkDicer - divide dataset into spatially aggregated pieces
SYNOPSIS
#include "/opt/vtk-c++/graphics/vtkDicer.h"
class VTK_EXPORT vtkDicer : public vtkDataSetToDataSetFilter
vtkDicer();
static vtkDicer *New() {return new vtkDicer;};
const char *GetClassName() {return "vtkDicer";};
void PrintSelf(ostream& os, vtkIndent indent);
void SetNumberOfPointsPerPiece(int);
int GetNumberOfPointsPerPiece();
int GetNumberOfPieces();
DESCRIPTION
vtkDicer separates the cells of a dataset into spatially aggregated pieces. These pieces can then be operated on by other filters (e.g., vtkThreshold). One application is to break very large polygonal models into pieces and performing viewing and occlusion culling on the pieces.
To use this filter, you must specify the number of points per piece. The filter attempts to create groups of points (containing the number of cells specified). The groups are created to minimize the size of the bounding box of the group. The filter indicates which group the points belong in by creating a scalar value corresponding to group number. Use the method GetNumberOfPieces() to determine how many pieces were found.
CAVEATS
The number of cells per group will not always be less than the requested value. The groups are not guaranteed to generate the minimal bounding boxes.
SUMMARY
void SetNumberOfPointsPerPiece(int)
Specify the number of cells per group (i.e., piece).
int GetNumberOfPieces()
Get the number of pieces the object was broken into. The return value is updated when the filter executes.
vtkDicer()
Create object with 5000 points per piece.