33   vtkSmartPointer<vtkPolygon> polygon = vtkSmartPointer<vtkPolygon>::New();  in TestPolygon()
68   convex &= vtkPolygon::IsConvex(polygon->GetPoints(),  in TestPolygon()
70   convex &= vtkPolygon::IsConvex(idArray,polygon->GetPoints());  in TestPolygon()
71   convex &= vtkPolygon::IsConvex(polygon->GetPoints());  in TestPolygon()
95   nonconvex &= !vtkPolygon::IsConvex(polygon->GetPoints(),  in TestPolygon()
97   nonconvex &= !vtkPolygon::IsConvex(idArray,polygon->GetPoints());  in TestPolygon()
98   nonconvex &= !vtkPolygon::IsConvex(polygon->GetPoints());  in TestPolygon()
122   convex &= vtkPolygon::IsConvex(polygon->GetPoints(),  in TestPolygon()
124   convex &= vtkPolygon::IsConvex(idArray,polygon->GetPoints());  in TestPolygon()
125   convex &= vtkPolygon::IsConvex(polygon->GetPoints());  in TestPolygon()
150   convex &= vtkPolygon::IsConvex(polygon->GetPoints(),  in TestPolygon()
152   convex &= vtkPolygon::IsConvex(idArray,polygon->GetPoints());  in TestPolygon()
153   convex &= vtkPolygon::IsConvex(polygon->GetPoints());  in TestPolygon()
177   vtkPolygon::ComputeNormal(polygon->GetNumberOfPoints(), points, normal);  in TestPolygon()
191   vtkPolygon::ComputeNormal(idArray, polygon->GetPoints(), normal);  in TestPolygon()
200   vtkSmartPointer<vtkPolygon> polygon1 = vtkSmartPointer<vtkPolygon>::New();  in TestPolygon()
228   vtkSmartPointer<vtkPolygon> polygon2 = vtkSmartPointer<vtkPolygon>::New();  in TestPolygon()
262 …int intersect = vtkPolygon::IntersectPolygonWithPolygon(static_cast<int>(polygon1->GetNumberOfPoin…  in TestPolygon()