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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
|
/*=========================================================================
Program: Visualization Toolkit
Module: $RCSfile: vtkDataSetSurfaceFilter.h,v $
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.
=========================================================================*/
// .NAME vtkDataSetSurfaceFilter - Extracts outer (polygonal) surface.
// .SECTION Description
// vtkDataSetSurfaceFilter is a faster version of vtkGeometry filter, but it
// does not have an option to select bounds. It may use more memory than
// vtkGeometryFilter. It only has one option: whether to use triangle strips
// when the input type is structured.
// .SECTION See Also
// vtkGeometryFilter vtkStructuredGridGeometryFilter.
#ifndef __vtkDataSetSurfaceFilter_h
#define __vtkDataSetSurfaceFilter_h
#include "vtkPolyDataAlgorithm.h"
class vtkPointData;
class vtkPoints;
class vtkIdTypeArray;
//BTX
struct vtkFastGeomQuadStruct;
typedef struct vtkFastGeomQuadStruct vtkFastGeomQuad;
//ETX
class VTK_GRAPHICS_EXPORT vtkDataSetSurfaceFilter : public vtkPolyDataAlgorithm
{
public:
static vtkDataSetSurfaceFilter *New();
vtkTypeRevisionMacro(vtkDataSetSurfaceFilter,vtkPolyDataAlgorithm);
void PrintSelf(ostream& os, vtkIndent indent);
// Description:
// When input is structured data, this flag will generate faces with
// triangle strips. This should render faster and use less memory, but no
// cell data is copied. By default, UseStrips is Off.
vtkSetMacro(UseStrips, int);
vtkGetMacro(UseStrips, int);
vtkBooleanMacro(UseStrips, int);
// Description:
// If PieceInvariant is true, vtkDataSetSurfaceFilter requests
// 1 ghost level from input in order to remove internal surface
// that are between processes. False by default.
vtkSetMacro(PieceInvariant, int);
vtkGetMacro(PieceInvariant, int);
// Description:
// If on, the output polygonal dataset will have a celldata array that
// holds the cell index of the original 3D cell that produced each output
// cell. This is useful for cell picking. The default is off to conserve
// memory.
vtkSetMacro(PassThroughCellIds,int);
vtkGetMacro(PassThroughCellIds,int);
vtkBooleanMacro(PassThroughCellIds,int);
vtkSetMacro(PassThroughPointIds,int);
vtkGetMacro(PassThroughPointIds,int);
vtkBooleanMacro(PassThroughPointIds,int);
protected:
vtkDataSetSurfaceFilter();
~vtkDataSetSurfaceFilter();
int UseStrips;
virtual int RequestUpdateExtent(vtkInformation *, vtkInformationVector **, vtkInformationVector *);
virtual int RequestData(vtkInformation *, vtkInformationVector **, vtkInformationVector *);
virtual int FillInputPortInformation(int port, vtkInformation *info);
int StructuredExecute(vtkDataSet *input, vtkPolyData *output, int *ext,
vtkInformation *inInfo);
int UnstructuredGridExecute(vtkDataSet *input, vtkPolyData *output);
int DataSetExecute(vtkDataSet *input, vtkPolyData *output);
// Helper methods.
void ExecuteFaceStrips(vtkDataSet *input, vtkPolyData *output,
int maxFlag, int *ext,
int aAxis, int bAxis, int cAxis,
vtkInformation *inInfo);
void ExecuteFaceQuads(vtkDataSet *input, vtkPolyData *output,
int maxFlag, int *ext,
int aAxis, int bAxis, int cAxis,
vtkInformation *inInfo);
void InitializeQuadHash(vtkIdType numPoints);
void DeleteQuadHash();
void InsertQuadInHash(vtkIdType a, vtkIdType b, vtkIdType c, vtkIdType d,
vtkIdType sourceId);
void InsertTriInHash(vtkIdType a, vtkIdType b, vtkIdType c,
vtkIdType sourceId);
void InsertPentaInHash(vtkIdType a, vtkIdType b,
vtkIdType c, vtkIdType d,
vtkIdType e,
vtkIdType sourceId);
void InsertHexInHash(vtkIdType a, vtkIdType b,
vtkIdType c, vtkIdType d,
vtkIdType e, vtkIdType f,
vtkIdType sourceId);
void InitQuadHashTraversal();
vtkFastGeomQuad *GetNextVisibleQuadFromHash();
vtkFastGeomQuad **QuadHash;
vtkIdType QuadHashLength;
vtkFastGeomQuad *QuadHashTraversal;
vtkIdType QuadHashTraversalIndex;
vtkIdType *PointMap;
vtkIdType GetOutputPointId(vtkIdType inPtId, vtkDataSet *input,
vtkPoints *outPts, vtkPointData *outPD);
vtkIdType NumberOfNewCells;
// Better memory allocation for faces (hash)
void InitFastGeomQuadAllocation(int numberOfCells);
vtkFastGeomQuad* NewFastGeomQuad();
void DeleteAllFastGeomQuads();
// -----
int FastGeomQuadArrayLength;
int NumberOfFastGeomQuadArrays;
vtkFastGeomQuad** FastGeomQuadArrays;
// These indexes allow us to find the next available face.
int NextArrayIndex;
int NextQuadIndex;
int PieceInvariant;
int PassThroughCellIds;
void RecordOrigCellId(vtkIdType newIndex, vtkIdType origId);
vtkIdTypeArray *OriginalCellIds;
int PassThroughPointIds;
void RecordOrigPointId(vtkIdType newIndex, vtkIdType origId);
vtkIdTypeArray *OriginalPointIds;
private:
vtkDataSetSurfaceFilter(const vtkDataSetSurfaceFilter&); // Not implemented.
void operator=(const vtkDataSetSurfaceFilter&); // Not implemented.
};
#endif
|
