62 void RemoveAllPlanes(
void );
74 int AddPlane(
double A,
double B,
double C );
75 int AddPlane(
double plane[3] );
85 void SetPlane(
int i,
double A,
double B,
double C );
86 void SetPlane(
int i,
double plane[3] );
92 int AddPlane(
double A,
double B,
double C,
double D );
93 int AddPlane(
double plane[3],
double D );
94 void SetPlane(
int i,
double A,
double B,
double C,
double D );
95 void SetPlane(
int i,
double plane[3],
double D );
104 vtkGetMacro( NumberOfPlanes,
int );
111 void AddCubeVertexPlanes();
117 void AddCubeEdgePlanes();
121 void AddCubeFacePlanes();
130 void AddRecursiveSpherePlanes(
int level );
141 void GenerateHull(
vtkPolyData *pd,
double *bounds);
142 void GenerateHull(
vtkPolyData *pd,
double xmin,
double xmax,
143 double ymin,
double ymax,
double zmin,
double zmax);
172 void CreateInitialPolygon(
double *,
int,
double * );
178 void operator=(
const vtkHull&);
virtual int RequestData(vtkInformation *request, vtkInformationVector **inputVector, vtkInformationVector *outputVector)
#define VTKFILTERSCORE_EXPORT
implicit function for convex set of planes
concrete dataset represents vertices, lines, polygons, and triangle strips
static vtkPolyDataAlgorithm * New()
void PrintSelf(ostream &os, vtkIndent indent)
Superclass for algorithms that produce only polydata as output.
produce an n-sided convex hull
a simple class to control print indentation
object to represent cell connectivity
represent and manipulate 3D points