vtkDelaunay2D.h

Go to the documentation of this file.

// SPDX-FileCopyrightText: Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
// SPDX-License-Identifier: BSD-3-Clause
#ifndef vtkDelaunay2D_h
#define vtkDelaunay2D_h
 
#include "vtkAbstractTransform.h" // For point transformation
#include "vtkFiltersCoreModule.h" // For export macro
#include "vtkPolyDataAlgorithm.h"
 
VTK_ABI_NAMESPACE_BEGIN
class vtkCellArray;
class vtkIdList;
class vtkPointSet;
 
#define VTK_DELAUNAY_XY_PLANE 0
#define VTK_SET_TRANSFORM_PLANE 1
#define VTK_BEST_FITTING_PLANE 2
 
class VTKFILTERSCORE_EXPORT vtkDelaunay2D : public vtkPolyDataAlgorithm
{
public:
  vtkTypeMacro(vtkDelaunay2D, vtkPolyDataAlgorithm);
  void PrintSelf(ostream& os, vtkIndent indent) override;
 
  static vtkDelaunay2D* New();
 
  void SetSourceData(vtkPolyData*);
 
  void SetSourceConnection(vtkAlgorithmOutput* algOutput);
 
  vtkPolyData* GetSource();
 
 
  vtkSetClampMacro(Alpha, double, 0.0, VTK_DOUBLE_MAX);
  vtkGetMacro(Alpha, double);
 
 
  vtkSetClampMacro(Tolerance, double, 0.0, 1.0);
  vtkGetMacro(Tolerance, double);
 
 
  vtkSetClampMacro(Offset, double, 0.75, VTK_DOUBLE_MAX);
  vtkGetMacro(Offset, double);
 
 
  vtkSetMacro(BoundingTriangulation, vtkTypeBool);
  vtkGetMacro(BoundingTriangulation, vtkTypeBool);
  vtkBooleanMacro(BoundingTriangulation, vtkTypeBool);
 
 
  vtkSetSmartPointerMacro(Transform, vtkAbstractTransform);
  vtkGetSmartPointerMacro(Transform, vtkAbstractTransform);
 
 
  vtkSetClampMacro(ProjectionPlaneMode, int, VTK_DELAUNAY_XY_PLANE, VTK_BEST_FITTING_PLANE);
  vtkGetMacro(ProjectionPlaneMode, int);
 
  static vtkAbstractTransform* ComputeBestFittingPlane(vtkPointSet* input);
 
 
  vtkSetMacro(RandomPointInsertion, vtkTypeBool);
  vtkGetMacro(RandomPointInsertion, vtkTypeBool);
  vtkBooleanMacro(RandomPointInsertion, vtkTypeBool);
 
protected:
  vtkDelaunay2D();
 
  int RequestData(vtkInformation*, vtkInformationVector**, vtkInformationVector*) override;
 
  double Alpha;
  double Tolerance;
  vtkTypeBool BoundingTriangulation;
  double Offset;
  vtkTypeBool RandomPointInsertion;
 
  // Transform input points (if necessary)
  vtkSmartPointer<vtkAbstractTransform> Transform;
 
  int ProjectionPlaneMode; // selects the plane in 3D where the Delaunay triangulation will be
                           // computed.
 
private:
  vtkSmartPointer<vtkPolyData> Mesh; // the created mesh
 
  // the raw points in double precision, and methods to access them
  double* Points;
  void SetPoint(vtkIdType id, double* x)
  {
    vtkIdType idx = 3 * id;
    this->Points[idx] = x[0];
    this->Points[idx + 1] = x[1];
    this->Points[idx + 2] = x[2];
  }
  void GetPoint(vtkIdType id, double x[3])
  {
    double* ptr = this->Points + 3 * id;
    x[0] = *ptr++;
    x[1] = *ptr++;
    x[2] = *ptr;
  }
 
  // Keep track of the bounding radius of all points (including the eight bounding points).
  // This is used occasionally for numerical sanity checks to determine whether a point is
  // within a circumcircle.
  double BoundingRadius2;
 
  int NumberOfDuplicatePoints;
  int NumberOfDegeneracies;
 
  // Various methods to support the Delaunay algorithm
  int* RecoverBoundary(vtkPolyData* source);
  int RecoverEdge(vtkPolyData* source, vtkIdType p1, vtkIdType p2);
  void FillPolygons(vtkCellArray* polys, int* triUse);
 
  int InCircle(double x[3], double x1[3], double x2[3], double x3[3]);
  vtkIdType FindTriangle(double x[3], vtkIdType ptIds[3], vtkIdType tri, double tol,
    vtkIdType nei[3], vtkIdList* neighbors);
 
  // CheckEdge() is a recursive function to determine if triangles satisfy the Delaunay
  // criterion. To prevent segfaults due to excessive recursion, recursion depth is limited.
  bool CheckEdge(vtkIdType ptId, double x[3], vtkIdType p1, vtkIdType p2, vtkIdType tri,
    bool recursive, unsigned int depth);
 
  int FillInputPortInformation(int, vtkInformation*) override;
 
  vtkDelaunay2D(const vtkDelaunay2D&) = delete;
  void operator=(const vtkDelaunay2D&) = delete;
};
 
VTK_ABI_NAMESPACE_END
#endif