96 #ifndef __vtkDelaunay3D_h
97 #define __vtkDelaunay3D_h
124 vtkGetMacro(Alpha,
double);
131 vtkSetClampMacro(Tolerance,
double,0.0,1.0);
132 vtkGetMacro(Tolerance,
double);
139 vtkGetMacro(Offset,
double);
147 vtkSetMacro(BoundingTriangulation,
int);
148 vtkGetMacro(BoundingTriangulation,
int);
149 vtkBooleanMacro(BoundingTriangulation,
int);
161 void CreateDefaultLocator();
196 void EndPointInsertion();
217 int InSphere(
double x[3],
vtkIdType tetraId);
virtual int RequestData(vtkInformation *request, vtkInformationVector **inputVector, vtkInformationVector *outputVector)
quickly locate points in 3-space
static vtkUnstructuredGridAlgorithm * New()
Abstract class in support of both point location and point insertion.
int NumberOfDuplicatePoints
abstract class for specifying dataset behavior
virtual int FillInputPortInformation(int port, vtkInformation *info)
create 3D Delaunay triangulation of input points
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
int BoundingTriangulation
represent and manipulate 3D points