You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
101 lines
2.7 KiB
C
101 lines
2.7 KiB
C
3 weeks ago
|
/*=========================================================================
|
||
|
|
|
||
|
|
Program: Visualization Toolkit
|
||
|
|
Module: vtkClipConvexPolyData.h
|
||
|
|
|
||
|
|
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.
|
||
|
|
|
||
|
|
=========================================================================*/
|
||
|
|
/**
|
||
|
|
* @class vtkClipConvexPolyData
|
||
|
|
* @brief clip any dataset with user-specified implicit function or input scalar data
|
||
|
|
*
|
||
|
|
* vtkClipConvexPolyData is a filter that clips a convex polydata with a set
|
||
|
|
* of planes. Its main usage is for clipping a bounding volume with frustum
|
||
|
|
* planes (used later one in volume rendering).
|
||
|
|
*/
|
||
|
|
|
||
|
|
#ifndef vtkClipConvexPolyData_h
|
||
|
|
#define vtkClipConvexPolyData_h
|
||
|
|
|
||
|
|
#include "vtkFiltersGeneralModule.h" // For export macro
|
||
|
|
#include "vtkPolyDataAlgorithm.h"
|
||
|
|
|
||
|
|
class vtkPlaneCollection;
|
||
|
|
class vtkPlane;
|
||
|
|
class vtkClipConvexPolyDataInternals;
|
||
|
|
|
||
|
|
class VTKFILTERSGENERAL_EXPORT vtkClipConvexPolyData : public vtkPolyDataAlgorithm
|
||
|
|
{
|
||
|
|
public:
|
||
|
|
static vtkClipConvexPolyData *New();
|
||
|
|
vtkTypeMacro(vtkClipConvexPolyData,vtkPolyDataAlgorithm);
|
||
|
|
void PrintSelf(ostream& os, vtkIndent indent) VTK_OVERRIDE;
|
||
|
|
|
||
|
|
//@{
|
||
|
|
/**
|
||
|
|
* Set all the planes at once using a vtkPlanes implicit function.
|
||
|
|
* This also sets the D value.
|
||
|
|
*/
|
||
|
|
void SetPlanes(vtkPlaneCollection *planes);
|
||
|
|
vtkGetObjectMacro(Planes,vtkPlaneCollection);
|
||
|
|
//@}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Redefines this method, as this filter depends on time of its components
|
||
|
|
* (planes)
|
||
|
|
*/
|
||
|
|
vtkMTimeType GetMTime() VTK_OVERRIDE;
|
||
|
|
|
||
|
|
protected:
|
||
|
|
vtkClipConvexPolyData();
|
||
|
|
~vtkClipConvexPolyData() VTK_OVERRIDE;
|
||
|
|
|
||
|
|
// The method that does it all...
|
||
|
|
int RequestData(vtkInformation *request,
|
||
|
|
vtkInformationVector **inputVector,
|
||
|
|
vtkInformationVector *outputVector) VTK_OVERRIDE;
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Clip the input with a given plane `p'.
|
||
|
|
* tolerance ?
|
||
|
|
*/
|
||
|
|
void ClipWithPlane(vtkPlane *p,
|
||
|
|
double tolerance);
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Tells if clipping the input by plane `p' creates some degeneracies.
|
||
|
|
*/
|
||
|
|
bool HasDegeneracies(vtkPlane *p);
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Delete calculation data.
|
||
|
|
*/
|
||
|
|
void ClearInternals();
|
||
|
|
|
||
|
|
/**
|
||
|
|
* ?
|
||
|
|
*/
|
||
|
|
void ClearNewVertices();
|
||
|
|
|
||
|
|
/**
|
||
|
|
* ?
|
||
|
|
*/
|
||
|
|
void RemoveEmptyPolygons();
|
||
|
|
|
||
|
|
vtkPlaneCollection *Planes;
|
||
|
|
vtkClipConvexPolyDataInternals *Internal;
|
||
|
|
|
||
|
|
private:
|
||
|
|
vtkClipConvexPolyData(const vtkClipConvexPolyData&) VTK_DELETE_FUNCTION;
|
||
|
|
void operator=(const vtkClipConvexPolyData&) VTK_DELETE_FUNCTION;
|
||
|
|
};
|
||
|
|
|
||
|
|
#endif
|