1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkClosestNPointsStrategy.cxx
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
#include "vtkClosestNPointsStrategy.h"
#include "vtkCell.h"
#include "vtkGenericCell.h"
#include "vtkIdList.h"
#include "vtkObjectFactory.h"
#include "vtkPointLocator.h"
#include "vtkPointSet.h"
#include "vtkStaticPointLocator.h"
#include <set>
//----------------------------------------------------------------------------
vtkStandardNewMacro(vtkClosestNPointsStrategy);
//----------------------------------------------------------------------------
vtkClosestNPointsStrategy::vtkClosestNPointsStrategy()
{
this->ClosestNPoints = 9;
}
//----------------------------------------------------------------------------
vtkClosestNPointsStrategy::~vtkClosestNPointsStrategy() {}
//-----------------------------------------------------------------------------
vtkIdType vtkClosestNPointsStrategy::FindCell(double x[3], vtkCell* cell, vtkGenericCell* gencell,
vtkIdType cellId, double tol2, int& subId, double pcoords[3], double* weights)
{
// First try standard strategy which is reasonably fast
vtkIdType foundCell =
this->Superclass::FindCell(x, cell, gencell, cellId, tol2, subId, pcoords, weights);
if (foundCell >= 0)
{
return foundCell;
}
// Couldn't find anything so try more time consuming strategy. It is
// possible that the closest point is not part of a cell containing the
// query point (i.e., a hanging node situation). In this case, look for the
// N closest points (beyond any coincident points identified
// previously). Typically N=9 (somewhat arbitrary, empirical, based on 2:1
// subdivision of hexahedral cells). Using large N affects performance but
// produces better results.
vtkIdType numPts = this->NearPointIds->GetNumberOfIds();
this->PointLocator->FindClosestNPoints(numPts + this->ClosestNPoints, x, this->NearPointIds);
numPts = this->NearPointIds->GetNumberOfIds();
vtkIdType i, j, ptId, numCells;
int ret;
double closest[3], dist2;
for (i = 0; i < numPts; ++i)
{
ptId = this->NearPointIds->GetId(i);
this->PointSet->GetPointCells(ptId, this->CellIds);
numCells = this->CellIds->GetNumberOfIds();
for (j = 0; j < numCells; j++)
{
cellId = this->CellIds->GetId(j);
if (this->VisitedCells.find(cellId) == this->VisitedCells.end())
{
cell = this->SelectCell(this->PointSet, cellId, nullptr, gencell);
ret = cell->EvaluatePosition(x, closest, subId, pcoords, dist2, weights);
if (ret != -1 && dist2 <= tol2)
{
return cellId;
}
this->VisitedCells.insert(cellId);
}
}
}
return -1;
}
//----------------------------------------------------------------------------
void vtkClosestNPointsStrategy::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os, indent);
}
|
