You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
169 lines
6.5 KiB
169 lines
6.5 KiB
/*=========================================================================
|
|
|
|
Program: Visualization Toolkit
|
|
Module: $RCSfile: vtkConvexPointSet.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 vtkConvexPointSet - a 3D cell defined by a set of convex points
|
|
// .SECTION Description
|
|
// vtkConvexPointSet is a concrete implementation that represents a 3D cell
|
|
// defined by a convex set of points. An example of such a cell is an octant
|
|
// (from an octree). vtkConvexPointSet uses the ordered triangulations
|
|
// approach (vtkOrderedTriangulator) to create triangulations guaranteed to
|
|
// be compatible across shared faces. This allows a general approach to
|
|
// processing complex, convex cell types.
|
|
|
|
// .SECTION See Also
|
|
// vtkHexahedron vtkPyramid vtkTetra vtkVoxel vtkWedge
|
|
|
|
#ifndef __vtkConvexPointSet_h
|
|
#define __vtkConvexPointSet_h
|
|
|
|
#include "vtkCell3D.h"
|
|
|
|
class vtkUnstructuredGrid;
|
|
class vtkCellArray;
|
|
class vtkTriangle;
|
|
class vtkTetra;
|
|
class vtkDoubleArray;
|
|
|
|
class VTK_FILTERING_EXPORT vtkConvexPointSet : public vtkCell3D
|
|
{
|
|
public:
|
|
static vtkConvexPointSet *New();
|
|
vtkTypeRevisionMacro(vtkConvexPointSet,vtkCell3D);
|
|
void PrintSelf(ostream& os, vtkIndent indent);
|
|
|
|
// Description:
|
|
// See vtkCell3D API for description of this method.
|
|
virtual int HasFixedTopology() {return 0;}
|
|
|
|
// Description:
|
|
// See vtkCell3D API for description of these methods.
|
|
virtual void GetEdgePoints(int vtkNotUsed(edgeId), int* &vtkNotUsed(pts)) {}
|
|
virtual void GetFacePoints(int vtkNotUsed(faceId), int* &vtkNotUsed(pts)) {}
|
|
virtual double *GetParametricCoords();
|
|
|
|
// Description:
|
|
// See the vtkCell API for descriptions of these methods.
|
|
virtual int GetCellType() {return VTK_CONVEX_POINT_SET;}
|
|
|
|
// Description:
|
|
// This cell requires that it be initialized prior to access.
|
|
virtual int RequiresInitialization() {return 1;}
|
|
virtual void Initialize();
|
|
|
|
// Description:
|
|
// A convex point set has no explicit cell edge or faces; however
|
|
// implicitly (after triangulation) it does. Currently the method
|
|
// GetNumberOfEdges() always returns 0 while the GetNumberOfFaces() returns
|
|
// the number of boundary triangles of the triangulation of the convex
|
|
// point set. The method GetNumberOfFaces() triggers a triangulation of the
|
|
// convex point set; repeated calls to GetFace() then return the boundary
|
|
// faces. (Note: GetNumberOfEdges() currently returns 0 because it is a
|
|
// rarely used method and hard to implement. It can be changed in the future.
|
|
virtual int GetNumberOfEdges() {return 0;}
|
|
virtual vtkCell *GetEdge(int) {return NULL;}
|
|
virtual int GetNumberOfFaces();
|
|
virtual vtkCell *GetFace(int faceId);
|
|
|
|
// Description:
|
|
// Satisfy the vtkCell API. This method contours by triangulating the
|
|
// cell and then contouring the resulting tetrahedra.
|
|
virtual void Contour(double value, vtkDataArray *cellScalars,
|
|
vtkPointLocator *locator, vtkCellArray *verts,
|
|
vtkCellArray *lines, vtkCellArray *polys,
|
|
vtkPointData *inPd, vtkPointData *outPd,
|
|
vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd);
|
|
|
|
// Description:
|
|
// Satisfy the vtkCell API. This method contours by triangulating the
|
|
// cell and then adding clip-edge intersection points into the
|
|
// triangulation; extracting the clipped region.
|
|
virtual void Clip(double value, vtkDataArray *cellScalars,
|
|
vtkPointLocator *locator, vtkCellArray *connectivity,
|
|
vtkPointData *inPd, vtkPointData *outPd,
|
|
vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd,
|
|
int insideOut);
|
|
|
|
// Description:
|
|
// Satisfy the vtkCell API. This method determines the subId, pcoords,
|
|
// and weights by triangulating the convex point set, and then
|
|
// determining which tetrahedron the point lies in.
|
|
virtual int EvaluatePosition(double x[3], double* closestPoint,
|
|
int& subId, double pcoords[3],
|
|
double& dist2, double *weights);
|
|
|
|
// Description:
|
|
// The inverse of EvaluatePosition.
|
|
virtual void EvaluateLocation(int& subId, double pcoords[3], double x[3],
|
|
double *weights);
|
|
|
|
// Description:
|
|
// Triangulates the cells and then intersects them to determine the
|
|
// intersection point.
|
|
virtual int IntersectWithLine(double p1[3], double p2[3], double tol, double& t,
|
|
double x[3], double pcoords[3], int& subId);
|
|
|
|
// Description:
|
|
// Triangulate using methods of vtkOrderedTriangulator.
|
|
virtual int Triangulate(int index, vtkIdList *ptIds, vtkPoints *pts);
|
|
|
|
// Description:
|
|
// Computes derivatives by triangulating and from subId and pcoords,
|
|
// evaluating derivatives on the resulting tetrahedron.
|
|
virtual void Derivatives(int subId, double pcoords[3], double *values,
|
|
int dim, double *derivs);
|
|
|
|
// Description:
|
|
// Returns the set of points forming a face of the triangulation of these
|
|
// points that are on the boundary of the cell that are closest
|
|
// parametrically to the point specified.
|
|
virtual int CellBoundary(int subId, double pcoords[3], vtkIdList *pts);
|
|
|
|
// Description:
|
|
// Return the center of the cell in parametric coordinates.
|
|
virtual int GetParametricCenter(double pcoords[3]);
|
|
|
|
// Description:
|
|
// A convex point set is triangulated prior to any operations on it so
|
|
// it is not a primary cell, it is a composite cell.
|
|
int IsPrimaryCell() {return 0;}
|
|
|
|
protected:
|
|
vtkConvexPointSet();
|
|
~vtkConvexPointSet();
|
|
|
|
vtkTetra *Tetra;
|
|
vtkIdList *TetraIds;
|
|
vtkPoints *TetraPoints;
|
|
vtkDoubleArray *TetraScalars;
|
|
|
|
vtkCellArray *BoundaryTris;
|
|
vtkTriangle *Triangle;
|
|
vtkDoubleArray *ParametricCoords;
|
|
|
|
private:
|
|
vtkConvexPointSet(const vtkConvexPointSet&); // Not implemented.
|
|
void operator=(const vtkConvexPointSet&); // Not implemented.
|
|
};
|
|
|
|
//----------------------------------------------------------------------------
|
|
inline int vtkConvexPointSet::GetParametricCenter(double pcoords[3])
|
|
{
|
|
pcoords[0] = pcoords[1] = pcoords[2] = 0.5;
|
|
return 0;
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|