130 #ifndef __vtkDelaunay2D_h
131 #define __vtkDelaunay2D_h
140 #define VTK_DELAUNAY_XY_PLANE 0
141 #define VTK_SET_TRANSFORM_PLANE 1
142 #define VTK_BEST_FITTING_PLANE 2
179 vtkGetMacro(Alpha,
double);
186 vtkSetClampMacro(Tolerance,
double,0.0,1.0);
187 vtkGetMacro(Tolerance,
double);
194 vtkGetMacro(Offset,
double);
202 vtkSetMacro(BoundingTriangulation,
int);
203 vtkGetMacro(BoundingTriangulation,
int);
204 vtkBooleanMacro(BoundingTriangulation,
int);
222 vtkSetClampMacro(ProjectionPlaneMode,
int,
224 vtkGetMacro(ProjectionPlaneMode,
int);
249 this->Points[idx] = x[0];
250 this->Points[idx+1] = x[1];
251 this->Points[idx+2] = x[2];
255 {
double *ptr = this->Points + 3*id;
261 int NumberOfDuplicatePoints;
262 int NumberOfDegeneracies;
268 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)
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