| /dports/math/vtk8/VTK-8.2.0/Common/DataModel/Testing/Cxx/ |
| H A D | TestPolygon.cxx | 33 vtkSmartPointer<vtkPolygon> polygon = vtkSmartPointer<vtkPolygon>::New(); in TestPolygon()
68 convex &= vtkPolygon::IsConvex(polygon->GetPoints(), in TestPolygon()
71 convex &= vtkPolygon::IsConvex(polygon->GetPoints()); in TestPolygon()
95 nonconvex &= !vtkPolygon::IsConvex(polygon->GetPoints(), in TestPolygon()
98 nonconvex &= !vtkPolygon::IsConvex(polygon->GetPoints()); in TestPolygon()
122 convex &= vtkPolygon::IsConvex(polygon->GetPoints(), in TestPolygon()
125 convex &= vtkPolygon::IsConvex(polygon->GetPoints()); in TestPolygon()
150 convex &= vtkPolygon::IsConvex(polygon->GetPoints(), in TestPolygon()
153 convex &= vtkPolygon::IsConvex(polygon->GetPoints()); in TestPolygon()
200 vtkSmartPointer<vtkPolygon> polygon1 = vtkSmartPointer<vtkPolygon>::New(); in TestPolygon()
[all …]
|
| H A D | TestMeanValueCoordinatesInterpolation2.cxx | 100 vtkPolygon *polygon = static_cast<vtkPolygon*>(polydata->GetCell(0)); in TestMeanValueCoordinatesInterpolation2()
161 vtkPolygon *polygon1 = static_cast<vtkPolygon*>(polydata1->GetCell(0)); in TestMeanValueCoordinatesInterpolation2()
|
| H A D | TestPolyhedronCutter.cxx | 69 vtkPolygon* cell = vtkPolygon::SafeDownCast(aCell); in TestPolyhedronCutter()
|
| /dports/math/vtk9/VTK-9.1.0/Common/DataModel/Testing/Cxx/ |
| H A D | TestPolygon.cxx | 34 vtkSmartPointer<vtkPolygon> polygon = vtkSmartPointer<vtkPolygon>::New(); in TestPolygon()
69 convex &= vtkPolygon::IsConvex(idArray, polygon->GetPoints()); in TestPolygon()
70 convex &= vtkPolygon::IsConvex(polygon->GetPoints()); in TestPolygon()
96 nonconvex &= !vtkPolygon::IsConvex(polygon->GetPoints()); in TestPolygon()
120 convex &= vtkPolygon::IsConvex(idArray, polygon->GetPoints()); in TestPolygon()
121 convex &= vtkPolygon::IsConvex(polygon->GetPoints()); in TestPolygon()
145 convex &= vtkPolygon::IsConvex(idArray, polygon->GetPoints()); in TestPolygon()
146 convex &= vtkPolygon::IsConvex(polygon->GetPoints()); in TestPolygon()
197 vtkSmartPointer<vtkPolygon> polygon1 = vtkSmartPointer<vtkPolygon>::New(); in TestPolygon()
225 vtkSmartPointer<vtkPolygon> polygon2 = vtkSmartPointer<vtkPolygon>::New(); in TestPolygon()
[all …]
|
| H A D | TestMeanValueCoordinatesInterpolation2.cxx | 93 vtkPolygon* polygon = static_cast<vtkPolygon*>(polydata->GetCell(0)); in TestMeanValueCoordinatesInterpolation2()
148 vtkPolygon* polygon1 = static_cast<vtkPolygon*>(polydata1->GetCell(0)); in TestMeanValueCoordinatesInterpolation2()
|
| H A D | TestPolyhedronCutter.cxx | 67 vtkPolygon* cell = vtkPolygon::SafeDownCast(aCell); in TestPolyhedronCutter()
|
| /dports/math/vtk6/VTK-6.2.0/Common/DataModel/Testing/Cxx/ |
| H A D | TestPolygon.cxx | 33 vtkSmartPointer<vtkPolygon> polygon = vtkSmartPointer<vtkPolygon>::New(); in TestPolygon()
67 vtkPolygon::ComputeNormal(polygon->GetNumberOfPoints(), points, normal); in TestPolygon()
81 vtkPolygon::ComputeNormal(idArray, polygon->GetPoints(), normal); in TestPolygon()
90 vtkSmartPointer<vtkPolygon> polygon1 = vtkSmartPointer<vtkPolygon>::New(); in TestPolygon()
118 vtkSmartPointer<vtkPolygon> polygon2 = vtkSmartPointer<vtkPolygon>::New(); in TestPolygon()
152 …int intersect = vtkPolygon::IntersectPolygonWithPolygon(static_cast<int>(polygon1->GetNumberOfPoin… in TestPolygon()
|
| H A D | TestMeanValueCoordinatesInterpolation2.cxx | 100 vtkPolygon *polygon = static_cast<vtkPolygon*>(polydata->GetCell(0)); in TestMeanValueCoordinatesInterpolation2()
161 vtkPolygon *polygon1 = static_cast<vtkPolygon*>(polydata1->GetCell(0)); in TestMeanValueCoordinatesInterpolation2()
|
| /dports/math/vtk9/VTK-9.1.0/Common/DataModel/ |
| H A D | vtkPolygon.cxx | 36 vtkStandardNewMacro(vtkPolygon);
40 vtkPolygon::vtkPolygon() in vtkPolygon() function in vtkPolygon
56 vtkPolygon::~vtkPolygon() in ~vtkPolygon()
68 void vtkPolygon::ComputeTolerance() in ComputeTolerance()
80 double vtkPolygon::ComputeArea() in ComputeArea()
84 return vtkPolygon::ComputeArea( in ComputeArea()
89 bool vtkPolygon::IsConvex() in IsConvex()
91 return vtkPolygon::IsConvex( in IsConvex()
414 void vtkPolygon::EvaluateLocation( in EvaluateLocation()
981 vtkPolygon* polygon = vtkPolygon::New(); in NonDegenerateTriangulate()
[all …]
|
| H A D | vtkPolygon.h | 39 class VTKCOMMONDATAMODEL_EXPORT vtkPolygon : public vtkCell
42 static vtkPolygon* New();
43 vtkTypeMacro(vtkPolygon, vtkCell);
247 vtkPolygon();
248 ~vtkPolygon() override;
312 vtkPolygon(const vtkPolygon&) = delete;
313 void operator=(const vtkPolygon&) = delete;
|
| H A D | vtkQuadraticPolygon.cxx | 32 this->Polygon = vtkPolygon::New(); in vtkQuadraticPolygon()
185 double result = vtkPolygon::DistanceToPolygon(x, numPts, convertedPts, bounds, closest); in DistanceToPolygon()
201 vtkPolygon::ComputeCentroid(convertedIds, convertedPts, c); in ComputeCentroid()
225 int result = vtkPolygon::IntersectPolygonWithPolygon( in IntersectPolygonWithPolygon()
238 vtkPolygon* convertedCell1 = nullptr; in IntersectConvex2DCells()
239 vtkPolygon* convertedCell2 = nullptr; in IntersectConvex2DCells()
244 convertedCell1 = vtkPolygon::New(); in IntersectConvex2DCells()
251 convertedCell2 = vtkPolygon::New(); in IntersectConvex2DCells()
255 int result = vtkPolygon::IntersectConvex2DCells((convertedCell1 ? convertedCell1 : cell1), in IntersectConvex2DCells()
277 int result = vtkPolygon::PointInPolygon(x, numPts, convertedPts, bounds, n); in PointInPolygon()
|
| H A D | vtkImplicitSelectionLoop.h | 55 class vtkPolygon; variable
130 vtkPolygon* Polygon;
|
| H A D | vtkImplicitSelectionLoop.cxx | 37 this->Polygon = vtkPolygon::New(); in vtkImplicitSelectionLoop()
66 vtkPolygon::ComputeNormal(this->Loop, this->Normal); in Initialize()
124 vtkPolygon::PointInPolygon(xProj, numPts, in EvaluateFunction()
|
| /dports/math/vtk6/VTK-6.2.0/Common/DataModel/ |
| H A D | vtkPolygon.h | 36 class VTKCOMMONDATAMODEL_EXPORT vtkPolygon : public vtkCell
39 static vtkPolygon *New();
40 vtkTypeMacro(vtkPolygon,vtkCell);
188 vtkPolygon();
189 ~vtkPolygon();
217 vtkPolygon(const vtkPolygon&); // Not implemented.
218 void operator=(const vtkPolygon&); // Not implemented.
|
| H A D | vtkPolygon.cxx | 33 vtkStandardNewMacro(vtkPolygon);
37 vtkPolygon::vtkPolygon() in vtkPolygon() function in vtkPolygon
53 vtkPolygon::~vtkPolygon() in ~vtkPolygon()
63 double vtkPolygon::ComputeArea() in ComputeArea()
67 return vtkPolygon::ComputeArea(this->GetPoints(), in ComputeArea()
789 int vtkPolygon::Triangulate(vtkIdList *outTris) in Triangulate()
920 vtkPolygon *polygon = vtkPolygon::New(); in NonDegenerateTriangulate()
1243 int vtkPolygon::EarCutTriangulation () in EarCutTriangulation()
1441 vtkCell *vtkPolygon::GetEdge(int edgeId) in GetEdge()
1708 vtkPolygon::ComputeNormal(npts2, pts2, n); in IntersectPolygonWithPolygon()
[all …]
|
| H A D | vtkQuadraticPolygon.cxx | 32 this->Polygon = vtkPolygon::New(); in vtkQuadraticPolygon()
208 double result = vtkPolygon::DistanceToPolygon(x, numPts, convertedPts, in DistanceToPolygon()
227 vtkPolygon::ComputeCentroid(convertedIds, convertedPts, c); in ComputeCentroid()
255 int result = vtkPolygon::IntersectPolygonWithPolygon( in IntersectPolygonWithPolygon()
271 vtkPolygon *convertedCell1 = 0; in IntersectConvex2DCells()
272 vtkPolygon *convertedCell2 = 0; in IntersectConvex2DCells()
277 convertedCell1 = vtkPolygon::New(); in IntersectConvex2DCells()
284 convertedCell2 = vtkPolygon::New(); in IntersectConvex2DCells()
288 int result = vtkPolygon::IntersectConvex2DCells( in IntersectConvex2DCells()
312 int result = vtkPolygon::PointInPolygon(x, numPts, convertedPts, bounds, n); in PointInPolygon()
|
| H A D | vtkImplicitSelectionLoop.h | 52 class vtkPolygon; variable
110 vtkPolygon *Polygon;
|
| /dports/math/vtk8/VTK-8.2.0/Common/DataModel/ |
| H A D | vtkPolygon.cxx | 33 vtkStandardNewMacro(vtkPolygon);
37 vtkPolygon::vtkPolygon() in vtkPolygon() function in vtkPolygon
53 vtkPolygon::~vtkPolygon() in ~vtkPolygon()
63 double vtkPolygon::ComputeArea() in ComputeArea()
75 bool vtkPolygon::IsConvex() in IsConvex()
77 return vtkPolygon::IsConvex(this->GetPoints(), in IsConvex()
320 bool vtkPolygon::IsConvex(vtkPoints *p) in IsConvex()
967 vtkPolygon *polygon = vtkPolygon::New(); in NonDegenerateTriangulate()
1385 int vtkPolygon::EarCutTriangulation () in EarCutTriangulation()
1628 vtkCell *vtkPolygon::GetEdge(int edgeId) in GetEdge()
[all …]
|
| H A D | vtkPolygon.h | 39 class VTKCOMMONDATAMODEL_EXPORT vtkPolygon : public vtkCell
42 static vtkPolygon *New();
43 vtkTypeMacro(vtkPolygon,vtkCell);
245 vtkPolygon();
246 ~vtkPolygon() override;
284 vtkPolygon(const vtkPolygon&) = delete;
285 void operator=(const vtkPolygon&) = delete;
|
| H A D | vtkQuadraticPolygon.cxx | 32 this->Polygon = vtkPolygon::New(); in vtkQuadraticPolygon()
208 double result = vtkPolygon::DistanceToPolygon(x, numPts, convertedPts, in DistanceToPolygon()
227 vtkPolygon::ComputeCentroid(convertedIds, convertedPts, c); in ComputeCentroid()
255 int result = vtkPolygon::IntersectPolygonWithPolygon( in IntersectPolygonWithPolygon()
271 vtkPolygon *convertedCell1 = nullptr; in IntersectConvex2DCells()
272 vtkPolygon *convertedCell2 = nullptr; in IntersectConvex2DCells()
277 convertedCell1 = vtkPolygon::New(); in IntersectConvex2DCells()
284 convertedCell2 = vtkPolygon::New(); in IntersectConvex2DCells()
288 int result = vtkPolygon::IntersectConvex2DCells( in IntersectConvex2DCells()
312 int result = vtkPolygon::PointInPolygon(x, numPts, convertedPts, bounds, n); in PointInPolygon()
|
| H A D | vtkImplicitSelectionLoop.h | 55 class vtkPolygon; variable
130 vtkPolygon *Polygon;
|
| /dports/math/vtk6/VTK-6.2.0/Filters/HyperTree/ |
| H A D | vtkHyperOctreeClipCutPointsGrabber.h | 29 class vtkPolygon; variable
84 vtkPolygon *GetPolygon();
93 vtkPolygon *Polygon;
|
| /dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/visualization/include/pcl/visualization/common/impl/ |
| H A D | shapes.hpp | 61 vtkSmartPointer<vtkPolygon> polygon = vtkSmartPointer<vtkPolygon>::New (); in createPolygon()
89 vtkSmartPointer<vtkPolygon> polygon = vtkSmartPointer<vtkPolygon>::New (); in createPolygon()
|
| /dports/math/vtk6/VTK-6.2.0/Rendering/Annotation/ |
| H A D | vtkConvexHull2D.h | 54 class vtkPolygon; variable
144 vtkSmartPointer<vtkPolygon> HullSource;
|
| /dports/math/vtk9/VTK-9.1.0/Rendering/Annotation/ |
| H A D | vtkConvexHull2D.h | 57 class vtkPolygon; variable
169 vtkSmartPointer<vtkPolygon> HullSource;
|