130 #ifndef vtkDelaunay2D_h
131 #define vtkDelaunay2D_h
141 #define VTK_DELAUNAY_XY_PLANE 0
142 #define VTK_SET_TRANSFORM_PLANE 1
143 #define VTK_BEST_FITTING_PLANE 2
181 vtkGetMacro(Alpha,
double);
188 vtkSetClampMacro(Tolerance,
double,0.0,1.0);
189 vtkGetMacro(Tolerance,
double);
196 vtkGetMacro(Offset,
double);
204 vtkSetMacro(BoundingTriangulation,
int);
205 vtkGetMacro(BoundingTriangulation,
int);
206 vtkBooleanMacro(BoundingTriangulation,
int);
224 vtkSetClampMacro(ProjectionPlaneMode,
int,
226 vtkGetMacro(ProjectionPlaneMode,
int);
251 this->Points[idx] = x[0];
252 this->Points[idx+1] = x[1];
253 this->Points[idx+2] = x[2];
257 {
double *ptr = this->Points + 3*id;
263 int NumberOfDuplicatePoints;
264 int NumberOfDegeneracies;
270 int InCircle (
double x[3],
double x1[3],
double x2[3],
double x3[3]);
virtual int FillInputPortInformation(int port, vtkInformation *info)
virtual int RequestData(vtkInformation *request, vtkInformationVector **inputVector, vtkInformationVector *outputVector)
#define VTKFILTERSCORE_EXPORT
abstract class for specifying dataset behavior
concrete dataset represents vertices, lines, polygons, and triangle strips
Proxy object to connect input/output ports.
static vtkPolyDataAlgorithm * New()
void PrintSelf(ostream &os, vtkIndent indent)
Superclass for algorithms that produce only polydata as output.
a simple class to control print indentation
list of point or cell ids
vtkAbstractTransform * Transform
#define VTK_BEST_FITTING_PLANE
boost::graph_traits< vtkGraph * >::vertex_descriptor source(boost::graph_traits< vtkGraph * >::edge_descriptor e, vtkGraph *)
object to represent cell connectivity
create 2D Delaunay triangulation of input points
#define VTK_DELAUNAY_XY_PLANE
int BoundingTriangulation