99 #ifndef vtkDelaunay3D_h 100 #define vtkDelaunay3D_h 200 void CreateDefaultLocator();
235 void EndPointInsertion();
virtual int RequestData(vtkInformation *request, vtkInformationVector **inputVector, vtkInformationVector *outputVector)
quickly locate points in 3-space
#define VTKFILTERSCORE_EXPORT
#define vtkGetMacro(name, type)
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
#define vtkSetClampMacro(name, type, min, max)
virtual int FillInputPortInformation(int port, vtkInformation *info)
create 3D Delaunay triangulation of input points
#define vtkTypeMacro(thisClass, superclass)
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.
#define vtkGetObjectMacro(name, type)
vtkTetraArray * TetraArray
GLsizei const GLfloat * points
#define vtkBooleanMacro(name, type)
int BoundingTriangulation
represent and manipulate 3D points
#define vtkSetMacro(name, type)