86#ifndef vtkGreedyTerrainDecimation_h
87#define vtkGreedyTerrainDecimation_h
89#include "vtkFiltersHybridModule.h"
100class vtkGreedyTerrainDecimationTerrainInfoType;
101class vtkGreedyTerrainDecimationPointInfoType;
103#define VTK_ERROR_NUMBER_OF_TRIANGLES 0
104#define VTK_ERROR_SPECIFIED_REDUCTION 1
105#define VTK_ERROR_ABSOLUTE 2
106#define VTK_ERROR_RELATIVE 3
127 vtkGetMacro(ErrorMeasure,
int);
157 vtkSetClampMacro(Reduction,
double, 0.0, 1.0);
158 vtkGetMacro(Reduction,
double);
168 vtkGetMacro(AbsoluteError,
double);
179 vtkGetMacro(RelativeError,
double);
258 int InCircle(
double x[3],
double x1[3],
double x2[3],
double x3[3]);
268 int*& midR,
int*& mid,
int mid2[2],
double h[3],
double& hMin,
double& hMax,
double& hL,
abstract superclass for arrays of numeric data
dynamic, self-adjusting array of double
dynamic, self-adjusting array of float
vtkFrustumSelector is a vtkSelector that selects elements based on whether they are inside or interse...
reduce height field (represented as image) to reduced TIN
int FillInputPortInformation(int port, vtkInformation *info) override
Fill the input port information objects for this algorithm.
int RequestData(vtkInformation *, vtkInformationVector **, vtkInformationVector *) override
This is called by the superclass.
void ComputeImageCoordinates(vtkIdType inputPtId, int ij[2])
void UpdateTriangle(vtkIdType triId, vtkIdType p1, vtkIdType p2, vtkIdType p3)
void GetTerrainPoint(int i, int j, double x[3])
vtkTypeBool BoundaryVertexDeletion
int CharacterizeTriangle(int ij1[2], int ij2[2], int ij[3], int *&min, int *&max, int *&midL, int *&midR, int *&mid, int mid2[2], double h[3], double &hMin, double &hMax, double &hL, double &hR)
void SetErrorMeasureToNumberOfTriangles()
Specify how to terminate the algorithm: either as an absolute number of triangles,...
vtkGreedyTerrainDecimationTerrainInfoType * TerrainInfo
void ComputePointNormal(int i, int j, float n[3])
void SetErrorMeasureToAbsoluteError()
Specify how to terminate the algorithm: either as an absolute number of triangles,...
static vtkGreedyTerrainDecimation * New()
Instantiate the class.
~vtkGreedyTerrainDecimation() override
vtkIdType InsertNextPoint(vtkIdType inputPtId, double x[3])
vtkTypeBool ComputeNormals
vtkIdType AddPointToTriangulation(vtkIdType inputPtId)
double * GetPoint(vtkIdType id)
vtkIdType NumberOfTriangles
vtkIdType FindTriangle(double x[3], vtkIdType ptIds[3], vtkIdType tri, double tol, vtkIdType nei[3], vtkIdList *neighbors, int &status)
void InsertBoundaryVertices()
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
void EstimateOutputSize(const vtkIdType numInputPts, vtkIdType &numPts, vtkIdType &numTris)
vtkGreedyTerrainDecimationPointInfoType * PointInfo
vtkGreedyTerrainDecimation()
void SetErrorMeasureToRelativeError()
Specify how to terminate the algorithm: either as an absolute number of triangles,...
void GetPoint(vtkIdType id, double x[3])
vtkIdType MaximumNumberOfTriangles
void UpdateTriangle(vtkIdType triId, int ij1[2], int ij2[2], int ij3[2], double h[4])
void SetErrorMeasureToSpecifiedReduction()
Specify how to terminate the algorithm: either as an absolute number of triangles,...
virtual int SatisfiesErrorMeasure(double error)
int InCircle(double x[3], double x1[3], double x2[3], double x3[3])
void CheckEdge(vtkIdType ptId, double x[3], vtkIdType p1, vtkIdType p2, vtkIdType tri, int depth)
void UpdateTriangles(vtkIdType meshPtId)
vtkPriorityQueue * TerrainError
list of point or cell ids
a simple class to control print indentation
represent and manipulate point attribute data
Superclass for algorithms that produce only polydata as output.
concrete dataset represents vertices, lines, polygons, and triangle strips
a list of ids arranged in priority order
#define VTK_ERROR_SPECIFIED_REDUCTION
#define VTK_ERROR_ABSOLUTE
#define VTK_ERROR_RELATIVE
#define VTK_ERROR_NUMBER_OF_TRIANGLES