forked from Kitware/VTK
-
Notifications
You must be signed in to change notification settings - Fork 0
/
vtkProbabilisticVoronoiKernel.cxx
94 lines (80 loc) · 2.75 KB
/
vtkProbabilisticVoronoiKernel.cxx
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
94
/*=========================================================================
Program: Visualization Toolkit
Module: vtkProbabilisticVoronoiKernel.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 "vtkProbabilisticVoronoiKernel.h"
#include "vtkAbstractPointLocator.h"
#include "vtkObjectFactory.h"
#include "vtkIdList.h"
#include "vtkDoubleArray.h"
#include "vtkDataSet.h"
#include "vtkPointData.h"
#include "vtkMath.h"
#include "vtkMathUtilities.h"
vtkStandardNewMacro(vtkProbabilisticVoronoiKernel);
//----------------------------------------------------------------------------
vtkProbabilisticVoronoiKernel::vtkProbabilisticVoronoiKernel()
{
}
//----------------------------------------------------------------------------
vtkProbabilisticVoronoiKernel::~vtkProbabilisticVoronoiKernel()
{
}
//----------------------------------------------------------------------------
vtkIdType vtkProbabilisticVoronoiKernel::
ComputeWeights(double x[3], vtkIdList *pIds, vtkDoubleArray *prob,
vtkDoubleArray *weights)
{
vtkIdType numPts = pIds->GetNumberOfIds();
double *p = (prob ? prob->GetPointer(0) : nullptr);
double highestProbability=VTK_FLOAT_MIN;
vtkIdType id, mostProbableId=0;
if ( p ) // return the point in the neighborhood with the highest probability
{
for (int i=0; i<numPts; ++i)
{
if ( p[i] > highestProbability )
{
mostProbableId = pIds->GetId(i);
highestProbability = p[i];
}
}
}
else //return the closest point in the footprint provided
{
double y[3], d, minD=VTK_FLOAT_MAX;
for (int i=0; i<numPts; ++i)
{
id = pIds->GetId(i);
this->DataSet->GetPoint(id,y);
d = vtkMath::Distance2BetweenPoints(x,y);
if ( vtkMathUtilities::FuzzyCompare(d, 0.0, std::numeric_limits<double>::epsilon()*256.0 )) //precise hit on existing point
{
mostProbableId = id;
break;
}
else if ( d <= minD )
{
mostProbableId = id;
minD = d;
}
}//over all points
}
// Okay let's get out
pIds->SetNumberOfIds(1);
pIds->SetId(0,mostProbableId);
weights->SetNumberOfTuples(1);
weights->SetValue(0,1.0);
return 1;
}
//----------------------------------------------------------------------------
void vtkProbabilisticVoronoiKernel::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os,indent);
}