/dports/graphics/mirtk/MIRTK-2.0.0-122-g38210fa/Modules/PointSet/src/ |
H A D | EdgeTable.cc | 87 vtkIdType cellId, edgeId, ptId1, ptId2; in Initialize() local 103 ptId1 = edge->PointIds->GetId(0); in Initialize() 104 for (int i = 1; i < numEdgePts; ++i, ptId1 = ptId2) { in Initialize() 107 for (entry = entries[ptId1].begin(); entry != entries[ptId1].end(); ++entry) { in Initialize() 116 if (ptId1 == ptId2) { in Initialize() 117 entries[ptId1].push_back(MakePair(static_cast<int>(ptId2), _NumberOfEdges)); in Initialize() 119 entries[ptId1].push_back(MakePair(static_cast<int>(ptId2), _NumberOfEdges)); in Initialize() 144 ptId1 = row[i1]; in Initialize() 145 if (ptId1 > ptId2) break; in Initialize() 146 i2 = col[ptId1]; in Initialize() [all …]
|
H A D | SurfaceRemeshing.cc | 194 _Output->GetPoint(ptId1, p); in MiddlePoint() 204 MiddlePoint(ptId1, ptId2, p); in MiddlePoint() 337 GetCellPointNeighbors(cellId, ptId1, ptIds1); in GetCellEdgeNeighborPoint() 573 _Output->GetPointCells(ptId1, cellIds); in MeltEdge() 591 InterpolatePointData(_Output->GetPointData(), ptId1, ptId1, ptId2); in MeltEdge() 594 const Point m = MiddlePoint(ptId1, ptId2); in MeltEdge() 609 _Output->GetPointCells(ptId1, cellIds); in MeltEdge() 630 if (ptId1 == -1) return false; in MeltTriangle() 905 pts[0] = ptId1; in Bisect() 938 pts[0] = ptId1; in Trisect() [all …]
|
H A D | SurfaceBoundary.cc | 73 int ptId1, ptId2; in SurfaceBoundary() local 77 ptId1 = *boundaryPtIds.begin(); in SurfaceBoundary() 80 ptIds.push_back(ptId1); in SurfaceBoundary() 81 boundaryPtIds.erase(ptId1); in SurfaceBoundary() 84 if (edge->first == ptId1) { in SurfaceBoundary() 90 } else if (edge->second == ptId1) { in SurfaceBoundary() 98 ptId1 = ptId2; in SurfaceBoundary() 99 } while (ptId1 != -1); in SurfaceBoundary()
|
H A D | PointSetUtils.cc | 369 vtkIdType ptId1, ptId2; in BoundaryPoints() local 387 vtkIdType ptId1, ptId2; in BoundaryEdges() local 447 int ptId1, ptId2; in BoundarySegments() local 460 ptIds.push_back(ptId1); in BoundarySegments() 478 ptId1 = ptId2; in BoundarySegments() 479 } while (ptId1 != -1); in BoundarySegments() 710 int ptId1, ptId2, edgeId; in operator ()() local 732 int ptId1, ptId2, edgeId; in operator ()() local 771 int ptId1, ptId2; in operator ()() local 809 int ptId1, ptId2; in operator ()() local [all …]
|
H A D | CellDataFilter.cc | 138 vtkIdType ptId1, ptId2; in GetEdgeNeighbors() local 149 ptId1 = edge->PointIds->GetId(0); in GetEdgeNeighbors() 150 for (int i = 1; i < npts; ++i, ptId1 = ptId2) { in GetEdgeNeighbors() 152 _Output->GetCellEdgeNeighbors(cellId, ptId1, ptId2, nbrIds.GetPointer()); in GetEdgeNeighbors()
|
H A D | SurfaceCurvature.cc | 89 vtkIdType ptId1, ptId2, cellId1, cellId2; in operator ()() local 97 ptId1 = ptIds->GetId(i); in operator ()() 102 _Surface->GetCellEdgeNeighbors(cellId1, ptId1, ptId2, adjCellIds.GetPointer()); in operator ()() 105 _Surface->GetPoint(ptId1, p1); in operator ()() 126 _Tensors->SetTuple(_EdgeTable->EdgeId(ptId1, ptId2), T); in operator ()()
|
H A D | SpectralDecomposition.cc | 513 vtkIdType ptId1, ptId2; in AdjacencyMatrix() local 517 for (it.InitTraversal(); it.GetNextEdge(ptId1, ptId2) != -1;) { in AdjacencyMatrix() 518 GetFeatures(dataset, ptId1, p1, &weights); in AdjacencyMatrix() 521 adjw[r1 + ptId1].push_back(MakePair(c1 + static_cast<int>(ptId2), w)); in AdjacencyMatrix() 522 adjw[r1 + ptId2].push_back(MakePair(c1 + static_cast<int>(ptId1), w)); in AdjacencyMatrix()
|
/dports/graphics/mirtk/MIRTK-2.0.0-122-g38210fa/Modules/PointSet/include/mirtk/ |
H A D | EdgeTable.h | 92 bool GetEdge(EdgeIdType, IdType1 &ptId1, IdType2 &ptId2) const; 120 inline bool EdgeTable::IsEdge(IdType1 ptId1, IdType2 ptId2) const in IsEdge() argument 122 return static_cast<bool>(Get(static_cast<int>(ptId1), static_cast<int>(ptId2))); in IsEdge() 127 inline int EdgeTable::EdgeId(IdType1 ptId1, IdType2 ptId2) const in EdgeId() argument 129 return Get(static_cast<int>(ptId1), static_cast<int>(ptId2)) - 1; in EdgeId() 134 inline bool EdgeTable::GetEdge(EdgeIdType edgeId, IdType1 &ptId1, IdType2 &ptId2) const in GetEdge() argument 147 ptId1 = static_cast<IdType1>(row[i]); in GetEdge() 149 if (ptId1 > ptId2) break; in GetEdge() 153 ptId1 = static_cast<IdType1>(-1); in GetEdge() 271 int GetNextEdge(IdType &ptId1, IdType &ptId2) in GetNextEdge() argument [all …]
|
/dports/math/vtk8/VTK-8.2.0/Imaging/Core/Testing/Cxx/ |
H A D | TestStencilWithPolyDataContour.cxx | 336 vtkIdType ptId1 = 0; in TestStencilWithPolyDataContour() local 341 ptId1 = points->InsertNextPoint(point); in TestStencilWithPolyDataContour() 344 lines->InsertCellPoint(ptId1); in TestStencilWithPolyDataContour() 350 ptId1 = points->InsertNextPoint(point); in TestStencilWithPolyDataContour() 353 lines->InsertCellPoint(ptId1); in TestStencilWithPolyDataContour()
|
/dports/math/vtk9/VTK-9.1.0/Imaging/Core/Testing/Cxx/ |
H A D | TestStencilWithPolyDataContour.cxx | 330 vtkIdType ptId1 = 0; in TestStencilWithPolyDataContour() local 335 ptId1 = points->InsertNextPoint(point); in TestStencilWithPolyDataContour() 338 lines->InsertCellPoint(ptId1); in TestStencilWithPolyDataContour() 344 ptId1 = points->InsertNextPoint(point); in TestStencilWithPolyDataContour() 347 lines->InsertCellPoint(ptId1); in TestStencilWithPolyDataContour()
|
/dports/math/vtk6/VTK-6.2.0/Imaging/Core/Testing/Cxx/ |
H A D | TestStencilWithPolyDataContour.cxx | 336 vtkIdType ptId1 = 0; in TestStencilWithPolyDataContour() local 341 ptId1 = points->InsertNextPoint(point); in TestStencilWithPolyDataContour() 344 lines->InsertCellPoint(ptId1); in TestStencilWithPolyDataContour() 350 ptId1 = points->InsertNextPoint(point); in TestStencilWithPolyDataContour() 353 lines->InsertCellPoint(ptId1); in TestStencilWithPolyDataContour()
|
/dports/math/vtk8/VTK-8.2.0/Filters/Modeling/ |
H A D | vtkSpherePuzzleArrows.cxx | 105 vtkIdType ptId1, ptId2, ptId3, ptId4, ptId5; in AppendArrow() local 152 ptId1 = pts->InsertNextPoint(this->Radius*x, this->Radius*y, this->Radius*z); in AppendArrow() 174 polys->InsertCellPoint(ptId1); in AppendArrow() 179 ptId1 = ptId3; in AppendArrow() 199 polys->InsertCellPoint(ptId1); in AppendArrow()
|
/dports/math/vtk9/VTK-9.1.0/Filters/Modeling/ |
H A D | vtkSpherePuzzleArrows.cxx | 101 vtkIdType ptId1, ptId2, ptId3, ptId4, ptId5; in AppendArrow() local 148 ptId1 = pts->InsertNextPoint(this->Radius * x, this->Radius * y, this->Radius * z); in AppendArrow() 168 polys->InsertCellPoint(ptId1); in AppendArrow() 173 ptId1 = ptId3; in AppendArrow() 193 polys->InsertCellPoint(ptId1); in AppendArrow()
|
/dports/math/vtk6/VTK-6.2.0/Filters/Modeling/ |
H A D | vtkSpherePuzzleArrows.cxx | 107 vtkIdType ptId1, ptId2, ptId3, ptId4, ptId5; in AppendArrow() local 154 ptId1 = pts->InsertNextPoint(this->Radius*x, this->Radius*y, this->Radius*z); in AppendArrow() 176 polys->InsertCellPoint(ptId1); in AppendArrow() 181 ptId1 = ptId3; in AppendArrow() 201 polys->InsertCellPoint(ptId1); in AppendArrow()
|
/dports/math/vtk9/VTK-9.1.0/Filters/General/ |
H A D | vtkIntersectionPolyDataFilter.cxx | 131 int CheckLine(vtkPolyData* pd, vtkIdType ptId1, vtkIdType ptId2); 304 vtkIdType ptId0, ptId1; in FindTriangleIntersections() local 310 if (ptId0 == ptId1) in FindTriangleIntersections() 315 if (ptId0 == ptId1 && surfaceid[0] != surfaceid[1]) in FindTriangleIntersections() 353 if (!unique[0] && !unique[1] && ptId0 != ptId1) in FindTriangleIntersections() 372 intersectionLines->InsertCellPoint(ptId1); in FindTriangleIntersections() 424 intersectionSurfaceId->InsertValue(ptId1, 3); in FindTriangleIntersections() 442 if (intersectionSurfaceId->GetValue(ptId1) == 1) in FindTriangleIntersections() 1690 pd->GetPoint(ptId1, pt1); in GetLoopOrientation() 1816 vtkPolyData* pd, vtkIdType ptId1, vtkIdType ptId2) in CheckLine() argument [all …]
|
H A D | vtkClipClosedSurface.cxx | 195 , ptId1(-1) in vtkCCSEdgeLocatorNode() 214 vtkIdType ptId1; member in vtkCCSEdgeLocatorNode 274 if (node->ptId1 < 0) in InsertUniqueEdge() 278 node->ptId1 = i1; in InsertUniqueEdge() 283 if (node->ptId0 == i0 && node->ptId1 == i1) in InsertUniqueEdge() 295 if (node->ptId0 == i0 && node->ptId1 == i1) in InsertUniqueEdge() 306 node->ptId1 = i1; in InsertUniqueEdge()
|
/dports/math/vtk8/VTK-8.2.0/Filters/General/ |
H A D | vtkIntersectionPolyDataFilter.cxx | 315 vtkIdType ptId0, ptId1; in FindTriangleIntersections() local 321 if (ptId0 == ptId1) in FindTriangleIntersections() 361 insert(std::make_pair(ptId1, cellId0)); in FindTriangleIntersections() 363 insert(std::make_pair(ptId1, cellId1)); in FindTriangleIntersections() 467 insert(std::make_pair(ptId1, cellId0)); in FindTriangleIntersections() 472 insert(std::make_pair(ptId1, cellId1)); in FindTriangleIntersections() 477 insert(std::make_pair(ptId1, cellId0)); in FindTriangleIntersections() 479 insert(std::make_pair(ptId1, cellId1)); in FindTriangleIntersections() 1766 pd->GetPoint(ptId1, pt1); in GetLoopOrientation() 1898 vtkPolyData *pd, vtkIdType ptId1, vtkIdType ptId2) in CheckLine() argument [all …]
|
H A D | vtkClipClosedSurface.cxx | 194 ptId0(-1), ptId1(-1), edgeId(-1), next(nullptr) {}; in vtkCCSEdgeLocatorNode() 208 vtkIdType ptId1; member in vtkCCSEdgeLocatorNode 271 if (node->ptId1 < 0) in InsertUniqueEdge() 275 node->ptId1 = i1; in InsertUniqueEdge() 280 if (node->ptId0 == i0 && node->ptId1 == i1) in InsertUniqueEdge() 292 if (node->ptId0 == i0 && node->ptId1 == i1) in InsertUniqueEdge() 303 node->ptId1 = i1; in InsertUniqueEdge()
|
H A D | vtkContourTriangulator.cxx | 1781 vtkIdType ptId1 = polys[outerPolyId][outerIdx]; in vtkCCSCheckCut() local 1787 points->GetPoint(ptId1, p1); in vtkCCSCheckCut() 1861 if (ptId1 != qtId1 && ptId1 != qtId2 && in vtkCCSCheckCut() 2154 vtkIdType ptId1 = polys[outerPolyId][cuts[bb][0]]; in vtkCCSMakeCuts() local 2156 points->GetPoint(ptId1, q); in vtkCCSMakeCuts()
|
/dports/math/vtk6/VTK-6.2.0/Filters/General/ |
H A D | vtkClipClosedSurface.cxx | 194 ptId0(-1), ptId1(-1), edgeId(-1), next(0) {}; in vtkCCSEdgeLocatorNode() 208 vtkIdType ptId1; member in vtkCCSEdgeLocatorNode 271 if (node->ptId1 < 0) in InsertUniqueEdge() 275 node->ptId1 = i1; in InsertUniqueEdge() 280 if (node->ptId0 == i0 && node->ptId1 == i1) in InsertUniqueEdge() 292 if (node->ptId0 == i0 && node->ptId1 == i1) in InsertUniqueEdge() 303 node->ptId1 = i1; in InsertUniqueEdge()
|
H A D | vtkIntersectionPolyDataFilter.cxx | 219 vtkIdType ptId0, ptId1; in FindTriangleIntersections() local 221 pointMerger->InsertUniquePoint(outpt1, ptId1); in FindTriangleIntersections() 223 intersectionLines->InsertCellPoint(ptId1); in FindTriangleIntersections() 229 info->PointCellIds[0]->InsertValue( ptId1, cellId0 ); in FindTriangleIntersections() 231 info->PointCellIds[1]->InsertValue( ptId1, cellId1 ); in FindTriangleIntersections() 242 info->AddToPointEdgeMap(0, ptId1, outpt1, mesh0, cellId0, in FindTriangleIntersections() 246 info->AddToPointEdgeMap(1, ptId1, outpt1, mesh1, cellId1, in FindTriangleIntersections()
|
/dports/graphics/mirtk/MIRTK-2.0.0-122-g38210fa/Applications/src/ |
H A D | remesh-surface.cc | 326 vtkIdType ptId1, ptId2; in main() local 330 for (it.InitTraversal(); it.GetNextEdge(ptId1, ptId2) != -1;) { in main() 331 mesh->GetPoint(ptId1, p1); in main()
|
H A D | calculate-surface-attributes.cc | 174 vtkIdType ptId1, ptId2; in GetCellEdgeNeighbors() local 182 ptId1 = edge->PointIds->GetId(0); in GetCellEdgeNeighbors() 183 for (vtkIdType i = 1; i < edge->GetNumberOfPoints(); ++i, ptId1 = ptId2) { in GetCellEdgeNeighbors() 185 surface->GetCellEdgeNeighbors(cellId, ptId1, ptId2, cellIds.GetPointer()); in GetCellEdgeNeighbors()
|
H A D | merge-surfaces.cc | 524 v1 = src->GetComponent(ptId1, j); in InterpolateCellData() 531 v1 = src->GetComponent(ptId1, j); in InterpolateCellData() 1935 const vtkIdType ptId1 = cellPtIds->GetId(edge); in InsertEdgeIntersection() local 1937 surface->GetCellEdgeNeighbors(cellId, ptId1, ptId2, cellIds.GetPointer()); in InsertEdgeIntersection() 1971 vtkIdType ptId1, vtkIdType ptId2, in InterpolateEdge() argument 1980 vtkIdType ptId1, vtkIdType ptId2, vtkIdType ptId3, in Bisect() argument 1989 const vtkIdType &newPtId1 = ptId1; in Bisect() 1995 InterpolateEdge(outputPD, inputPD, ptId1, ptId2, intersection); in Bisect() 2015 vtkIdType ptId1, vtkIdType ptId2, vtkIdType ptId3, in Trisect() argument 2026 const vtkIdType &newPtId1 = ptId1; in Trisect() [all …]
|
/dports/science/rdkit/rdkit-Release_2021_03_5/Code/Geometry/ |
H A D | UniformGrid3D.cpp | 239 int ptId1, ptId2; in setSphereOccupancy() local 245 ptId1 = k * d_numX * d_numY; in setSphereOccupancy() 253 ptId2 = ptId1 + j * d_numX; in setSphereOccupancy()
|