14 #ifndef vtkProjectSphereFilter_h
15 #define vtkProjectSphereFilter_h
17 #include "vtkFiltersGeometryModule.h"
20 VTK_ABI_NAMESPACE_BEGIN
40 vtkSetVector3Macro(Center,
double);
41 vtkGetVectorMacro(Center,
double, 3);
49 vtkGetMacro(KeepPolePoints,
bool);
50 vtkSetMacro(KeepPolePoints,
bool);
51 vtkBooleanMacro(KeepPolePoints,
bool);
60 vtkGetMacro(TranslateZ,
bool);
61 vtkSetMacro(TranslateZ,
bool);
62 vtkBooleanMacro(TranslateZ,
bool);
104 const double SplitLongitude;
109 VTK_ABI_NAMESPACE_END
110 #endif // vtkProjectSphereFilter_h
virtual int RequestData(vtkInformation *, vtkInformationVector **, vtkInformationVector *)
This is called by the superclass.
Abstract class in support of both point location and point insertion.
void PrintSelf(ostream &os, vtkIndent indent) override
Standard methods for instantiation, obtaining type information, and printing instances of the class...
concrete class for storing a set of points
int FillInputPortInformation(int port, vtkInformation *info) override
Fill the input port information objects for this algorithm.
abstract class to specify cell behavior
virtual void ComputePointsClosestToCenterLine(double, vtkIdList *)
Parallel part of the algorithm to figure out the closest point to the centerline (i.e.
a simple class to control print indentation
list of point or cell ids
dataset represents arbitrary combinations of all possible cell types
Superclass for algorithms that process vtkPointSet input.
represent and manipulate attribute data in a dataset
object to represent cell connectivity
static vtkPointSetAlgorithm * New()
Standard methods for instantiation, obtaining type information, and printing instances of the class...
A filter to 'unroll' a sphere.