1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkCoincidentPoints.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.
=========================================================================*/
/*-------------------------------------------------------------------------
Copyright 2008 Sandia Corporation.
Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
the U.S. Government retains certain rights in this software.
-------------------------------------------------------------------------*/
/**
* @class vtkCoincidentPoints
* @brief contains an octree of labels
*
*
* This class provides a collection of points that is organized such that
* each coordinate is stored with a set of point id's of points that are
* all coincident.
*/
#ifndef vtkCoincidentPoints_h
#define vtkCoincidentPoints_h
#include "vtkFiltersGeneralModule.h" // For export macro
#include "vtkObject.h"
class vtkIdList;
class vtkPoints;
class VTKFILTERSGENERAL_EXPORT vtkCoincidentPoints : public vtkObject
{
public:
static vtkCoincidentPoints* New();
vtkTypeMacro(vtkCoincidentPoints,vtkObject);
void PrintSelf( ostream& os, vtkIndent indent ) VTK_OVERRIDE;
/**
* Accumulates a set of Ids in a map where the point coordinate
* is the key. All Ids in a given map entry are thus coincident.
* @param Id - a unique Id for the given \a point that will be stored in an vtkIdList.
* @param[in] point - the point coordinate that we will store in the map to test if any other points are
* coincident with it.
*/
void AddPoint(vtkIdType Id, const double point[3]);
/**
* Retrieve the list of point Ids that are coincident with the given \a point.
* @param[in] point - the coordinate of coincident points we want to retrieve.
*/
vtkIdList * GetCoincidentPointIds(const double point[3]);
/**
* Used to iterate the sets of coincident points within the map.
* InitTraversal must be called first or NULL will always be returned.
*/
vtkIdList * GetNextCoincidentPointIds();
/**
* Initialize iteration to the beginning of the coincident point map.
*/
void InitTraversal();
/**
* Iterate through all added points and remove any entries that have
* no coincident points (only a single point Id).
*/
void RemoveNonCoincidentPoints();
/**
* Clear the maps for reuse. This should be called if the caller
* might reuse this class (another executive pass for instance).
*/
void Clear();
class implementation;
implementation * GetImplementation() { return this->Implementation; }
/**
* Calculate \a num points, at a regular interval, along a parametric
* spiral. Note this spiral is only in two dimensions having a constant
* z value.
*/
static void SpiralPoints(vtkIdType num, vtkPoints * offsets);
protected:
vtkCoincidentPoints();
~vtkCoincidentPoints() VTK_OVERRIDE;
private:
vtkCoincidentPoints( const vtkCoincidentPoints& ) VTK_DELETE_FUNCTION;
void operator = ( const vtkCoincidentPoints& ) VTK_DELETE_FUNCTION;
implementation* Implementation;
friend class implementation;
};
#endif // vtkCoincidentPoints_h
|
