merge exactly coincident points
More...
#include <vtkMergePoints.h>
|
virtual const char * | GetClassName () |
|
virtual int | IsA (const char *type) |
|
void | PrintSelf (ostream &os, vtkIndent indent) |
|
int | InsertUniquePoint (const double x[3], vtkIdType &ptId) |
|
|
vtkIdType | IsInsertedPoint (const double x[3]) |
|
vtkIdType | IsInsertedPoint (double x, double y, double z) |
|
void | PrintSelf (ostream &os, vtkIndent indent) |
|
virtual vtkIdType | FindClosestPoint (const double x[3]) |
|
virtual int | InitPointInsertion (vtkPoints *newPts, const double bounds[6]) |
|
virtual void | InsertPoint (vtkIdType ptId, const double x[3]) |
|
virtual vtkIdType | InsertNextPoint (const double x[3]) |
|
virtual vtkIdType | FindClosestInsertedPoint (const double x[3]) |
|
virtual void | FindClosestNPoints (int N, const double x[3], vtkIdList *result) |
|
virtual vtkIdList * | GetPointsInBucket (const double x[3], int ijk[3]) |
|
virtual void | SetDivisions (int, int, int) |
|
virtual void | SetDivisions (int[3]) |
|
virtual int * | GetDivisions () |
|
virtual void | GetDivisions (int data[3]) |
|
virtual void | SetNumberOfPointsPerBucket (int) |
|
virtual int | GetNumberOfPointsPerBucket () |
|
virtual vtkIdType | FindClosestPointWithinRadius (double radius, const double x[3], double &dist2) |
|
virtual vtkIdType | FindClosestPointWithinRadius (double radius, const double x[3], double inputDataLength, double &dist2) |
|
virtual int | InitPointInsertion (vtkPoints *newPts, const double bounds[6], vtkIdType estSize) |
|
vtkIdType | IsInsertedPoint (double x, double y, double z) |
|
virtual void | FindDistributedPoints (int N, const double x[3], vtkIdList *result, int M) |
|
virtual void | FindDistributedPoints (int N, double x, double y, double z, vtkIdList *result, int M) |
|
virtual void | FindPointsWithinRadius (double R, const double x[3], vtkIdList *result) |
|
virtual vtkPoints * | GetPoints () |
|
void | Initialize () |
|
void | FreeSearchStructure () |
|
void | BuildLocator () |
|
void | GenerateRepresentation (int level, vtkPolyData *pd) |
|
|
| vtkMergePoints () |
|
| ~vtkMergePoints () |
|
| vtkPointLocator () |
|
virtual | ~vtkPointLocator () |
|
void | GetBucketNeighbors (vtkNeighborPoints *buckets, const int ijk[3], const int ndivs[3], int level) |
|
void | GetOverlappingBuckets (vtkNeighborPoints *buckets, const double x[3], const int ijk[3], double dist, int level) |
|
void | GetOverlappingBuckets (vtkNeighborPoints *buckets, const double x[3], double dist, int prevMinLevel[3], int prevMaxLevel[3]) |
|
void | GenerateFace (int face, int i, int j, int k, vtkPoints *pts, vtkCellArray *polys) |
|
double | Distance2ToBucket (const double x[3], const int nei[3]) |
|
double | Distance2ToBounds (const double x[3], const double bounds[6]) |
|
merge exactly coincident points
vtkMergePoints is a locator object to quickly locate points in 3D. The primary difference between vtkMergePoints and its superclass vtkPointLocator is that vtkMergePoints merges precisely coincident points and is therefore much faster.
- See also
- vtkCleanPolyData
- Tests:
- vtkMergePoints (Tests)
Definition at line 34 of file vtkMergePoints.h.
vtkMergePoints::vtkMergePoints |
( |
| ) |
|
|
inlineprotected |
vtkMergePoints::~vtkMergePoints |
( |
| ) |
|
|
inlineprotected |
virtual const char* vtkMergePoints::GetClassName |
( |
| ) |
|
|
virtual |
static int vtkMergePoints::IsTypeOf |
( |
const char * |
type | ) |
|
|
static |
virtual int vtkMergePoints::IsA |
( |
const char * |
type | ) |
|
|
virtual |
void vtkMergePoints::PrintSelf |
( |
ostream & |
os, |
|
|
vtkIndent |
indent |
|
) |
| |
vtkIdType vtkMergePoints::IsInsertedPoint |
( |
const double |
x[3] | ) |
|
|
virtual |
Determine whether point given by x[3] has been inserted into points list. Return id of previously inserted point if this is true, otherwise return -1.
Reimplemented from vtkPointLocator.
vtkIdType vtkMergePoints::IsInsertedPoint |
( |
double |
x, |
|
|
double |
y, |
|
|
double |
z |
|
) |
| |
|
inline |
Determine whether point given by x[3] has been inserted into points list. Return id of previously inserted point if this is true, otherwise return -1.
Definition at line 46 of file vtkMergePoints.h.
int vtkMergePoints::InsertUniquePoint |
( |
const double |
x[3], |
|
|
vtkIdType & |
ptId |
|
) |
| |
|
virtual |
Determine whether point given by x[3] has been inserted into points list. Return 0 if point was already in the list, otherwise return 1. If the point was not in the list, it will be ADDED. In either case, the id of the point (newly inserted or not) is returned in the ptId argument. Note this combines the functionality of IsInsertedPoint() followed by a call to InsertNextPoint().
Reimplemented from vtkPointLocator.
The documentation for this class was generated from the following file: