判断指定点在不在polydata内部的两种方式

1. 方法一：vtkCellLocator FindClosestPoint
   计算两点之间的距离，不过这个方法，返回的参数是距离的平方

bool CheckPointInsidePolyData(vtkPolyData * poly, double* pt)
{
	bool isInside=false; 
	auto cellLocator = vtkSmartPointer<vtkCellLocator>::New();
	cellLocator->SetDataSet(poly);
	cellLocator->BuildLocator();
	auto assistCell = vtkSmartPointer<vtkGenericCell>::New();
	// 接收最近点的坐标
	double closestPoint[3];
	// 接收最近点的距离
	double closestPointDist2;
	// 最近cell的id
	vtkIdType cellId; 
	int subId=-1;
	cellLocator->FindClosestPoint(point, closestPoint, assistCell, cellId, subId, closestPointDist2);
 
	if (-1!= subId&&closestPointDist2 < 0.001)
	{
		isInside=true;
	}
	return isInside;
}

2. 方法二：vtkSelectEnclosedPoints

	double point[3] = { aPoint[0],aPoint[1],aPoint[2] };
	// 输入要检验的点集合，此处只设置一个点
	vtkNew<vtkPoints> checkPoint;
	checkPoint->InsertNextPoint(point[0], point[1], point[2]);
	// 将点转换成polydata对象
	vtkNew<vtkPolyData> pointsPolyData;
	pointsPolyData->SetPoints(checkPoint);

	vtkNew<vtkSelectEnclosedPoints> selectEnclosedPoints;
	selectEnclosedPoints->SetSurfaceData(myPolyData);
	selectEnclosedPoints->SetInputData(pointsPolyData);
	// 进行计算
	selectEnclosedPoints->Update();

	// 判断第一个点是否在polydata内部
	bool isInside = selectEnclosedPoints->IsInside(0);
```cpp