28 #ifndef vtkConvexHull_h
29 #define vtkConvexHull_h
31 #include "vtkFiltersCoreModule.h"
38 VTK_ABI_NAMESPACE_BEGIN
63 vtkSetClampMacro(Dimension,
int, 1, 3);
64 vtkGetMacro(Dimension,
int);
73 vtkSetMacro(GeneratePolyData,
bool);
74 vtkGetMacro(GeneratePolyData,
bool);
75 vtkBooleanMacro(GeneratePolyData,
bool);
82 bool IsPointWithinConvexHull(
double x,
double y,
double z,
double tol = 1e-8)
const;
83 bool IsPointWithinConvexHull(
const double point[3],
double tol = 1e-8)
const;
89 static bool IsPointInside(
90 const vtkVector3d& p,
const std::vector<Plane>& planes,
double tol = 1e-8);
97 static void ComputeConvexHull(
vtkDataArray*
points,
int dimension, std::vector<Plane>& planes);
104 static void ComputeConvexHull(
105 const vtkVector3d*
points,
int numPoints,
int dimension, std::vector<Plane>& planes);
119 bool GeneratePolyData{
true };
120 std::vector<Plane> HullPlanes;
122 static void Compute1D(
124 static void Compute2D(
126 static void Compute3D(
130 VTK_ABI_NAMESPACE_END
131 #endif // vtkConvexHull_h
Convex hull and point-in-hull testing for 1-D, 2-D, and 3-D point sets.
Half-plane representation: point P is inside the hull iff P·Normal ≤ D for every plane in the set...
virtual int RequestData(vtkInformation *, vtkInformationVector **, vtkInformationVector *)
This is called by the superclass.
void PrintSelf(ostream &os, vtkIndent indent) override
Standard methods for instantiation, obtaining type information, and printing instances of the class...
concrete dataset represents vertices, lines, polygons, and triangle strips
int FillOutputPortInformation(int port, vtkInformation *info) override
Fill the output port information objects for this algorithm.
a simple class to control print indentation
abstract superclass for arrays of numeric data
Superclass for algorithms that process vtkPointSet input.
static vtkPointSetAlgorithm * New()
Standard methods for instantiation, obtaining type information, and printing instances of the class...