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
95
96
97
98
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkEmptyCell.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 "vtkEmptyCell.h"
#include "vtkCellArray.h"
#include "vtkMath.h"
#include "vtkObjectFactory.h"
#include "vtkPoints.h"
vtkStandardNewMacro(vtkEmptyCell);
//----------------------------------------------------------------------------
int vtkEmptyCell::EvaluatePosition(const double vtkNotUsed(x)[3], double closestPoint[3],
int& subId, double pcoords[3], double& dist2, double vtkNotUsed(weights)[])
{
pcoords[0] = pcoords[1] = pcoords[2] = -1.0;
subId = 0;
if (closestPoint != nullptr)
{
closestPoint[0] = closestPoint[1] = closestPoint[2] = 0.0;
dist2 = -1.0;
}
return 0;
}
//----------------------------------------------------------------------------
void vtkEmptyCell::EvaluateLocation(int& vtkNotUsed(subId), const double vtkNotUsed(pcoords)[3],
double x[3], double* vtkNotUsed(weights))
{
x[0] = x[1] = x[2] = 0.0;
}
//----------------------------------------------------------------------------
int vtkEmptyCell::CellBoundary(
int vtkNotUsed(subId), const double vtkNotUsed(pcoords)[3], vtkIdList* pts)
{
pts->Reset();
return 0;
}
//----------------------------------------------------------------------------
void vtkEmptyCell::Contour(double vtkNotUsed(value), vtkDataArray* vtkNotUsed(cellScalars),
vtkIncrementalPointLocator* vtkNotUsed(locator), vtkCellArray* vtkNotUsed(verts),
vtkCellArray* vtkNotUsed(lines), vtkCellArray* vtkNotUsed(polys), vtkPointData* vtkNotUsed(inPd),
vtkPointData* vtkNotUsed(outPd), vtkCellData* vtkNotUsed(inCd), vtkIdType vtkNotUsed(cellId),
vtkCellData* vtkNotUsed(outCd))
{
}
//----------------------------------------------------------------------------
// Project point on line. If it lies between 0<=t<=1 and distance off line
// is less than tolerance, intersection detected.
int vtkEmptyCell::IntersectWithLine(const double vtkNotUsed(p1)[3], const double vtkNotUsed(p2)[3],
double vtkNotUsed(tol), double& vtkNotUsed(t), double vtkNotUsed(x)[3],
double vtkNotUsed(pcoords)[3], int& vtkNotUsed(subId))
{
return 0;
}
//----------------------------------------------------------------------------
int vtkEmptyCell::Triangulate(int vtkNotUsed(index), vtkIdList* ptIds, vtkPoints* pts)
{
pts->Reset();
ptIds->Reset();
return 1;
}
//----------------------------------------------------------------------------
void vtkEmptyCell::Derivatives(int vtkNotUsed(subId), const double vtkNotUsed(pcoords)[3],
const double* vtkNotUsed(values), int vtkNotUsed(dim), double* vtkNotUsed(derivs))
{
}
//----------------------------------------------------------------------------
void vtkEmptyCell::Clip(double vtkNotUsed(value), vtkDataArray* vtkNotUsed(cellScalars),
vtkIncrementalPointLocator* vtkNotUsed(locator), vtkCellArray* vtkNotUsed(verts),
vtkPointData* vtkNotUsed(inPD), vtkPointData* vtkNotUsed(outPD), vtkCellData* vtkNotUsed(inCD),
vtkIdType vtkNotUsed(cellId), vtkCellData* vtkNotUsed(outCD), int vtkNotUsed(insideOut))
{
}
//----------------------------------------------------------------------------
void vtkEmptyCell::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os, indent);
}
|
