96 #ifndef __vtkDelaunay3D_h
97 #define __vtkDelaunay3D_h
125 vtkGetMacro(Alpha,
double);
132 vtkSetClampMacro(Tolerance,
double,0.0,1.0);
133 vtkGetMacro(Tolerance,
double);
140 vtkGetMacro(Offset,
double);
148 vtkSetMacro(BoundingTriangulation,
int);
149 vtkGetMacro(BoundingTriangulation,
int);
150 vtkBooleanMacro(BoundingTriangulation,
int);
162 void CreateDefaultLocator();
197 void EndPointInsertion();
206 vtkSetMacro(OutputPointsPrecision,
int);
207 vtkGetMacro(OutputPointsPrecision,
int);
virtual int RequestData(vtkInformation *request, vtkInformationVector **inputVector, vtkInformationVector *outputVector)
quickly locate points in 3-space
#define VTKFILTERSCORE_EXPORT
static vtkUnstructuredGridAlgorithm * New()
Abstract class in support of both point location and point insertion.
int NumberOfDuplicatePoints
int OutputPointsPrecision
abstract class for specifying dataset behavior
GLuint GLsizei GLsizei * length
virtual int FillInputPortInformation(int port, vtkInformation *info)
create 3D Delaunay triangulation of input points
GLint GLint GLint GLint GLint x
GLint GLint GLsizei GLsizei GLsizei depth
vtkIncrementalPointLocator * Locator
virtual unsigned long GetMTime()
a simple class to control print indentation
list of point or cell ids
dataset represents arbitrary combinations of all possible cell types
void PrintSelf(ostream &os, vtkIndent indent)
Superclass for algorithms that produce only unstructured grid as output.
vtkTetraArray * TetraArray
GLsizei const GLfloat * points
int BoundingTriangulation
represent and manipulate 3D points