ActiViz .NET  5.8.0
Public Member Functions | Static Public Member Functions | Public Attributes | Static Public Attributes | Protected Member Functions | Private Member Functions | Static Private Member Functions
Kitware.VTK.vtkKdTree Class Reference

vtkKdTree - a Kd-tree spatial decomposition of a set of points More...

Inheritance diagram for Kitware.VTK.vtkKdTree:
[legend]
Collaboration diagram for Kitware.VTK.vtkKdTree:
[legend]

List of all members.

Public Member Functions

 vtkKdTree (IntPtr rawCppThis, bool callDisposalMethod, bool strong)
 Automatically generated constructor - called from generated code. DO NOT call directly.
 vtkKdTree ()
 Undocumented Block.
virtual void AddDataSet (vtkDataSet set)
 This class can compute a spatial decomposition based on the cells in a list of one or more input data sets. Add them one at a time with this method.
IntPtr AllGetRegionContainingCell ()
 Get a list (in order by data set by cell id) of the region IDs of the region containing the centroid for each cell. This is faster than calling GetRegionContainingCell for each cell in the DataSet. vtkKdTree uses this list, so don't delete it.
override void BuildLocator ()
 Create the k-d tree decomposition of the cells of the data set or data sets. Cells are assigned to k-d tree spatial regions based on the location of their centroids.
void BuildLocatorFromPoints (vtkPointSet pointset)
 This is a special purpose locator that builds a k-d tree to find duplicate and near-by points. It builds the tree from one or more vtkPoints objects instead of from the cells of a vtkDataSet. This build would normally be followed by BuildMapForDuplicatePoints, FindPoint, or FindClosestPoint. Since this will build a normal k-d tree, all the region intersection queries will still work, as will most other calls except those that have "Cell" in the name.
void BuildLocatorFromPoints (vtkPoints ptArray)
 This is a special purpose locator that builds a k-d tree to find duplicate and near-by points. It builds the tree from one or more vtkPoints objects instead of from the cells of a vtkDataSet. This build would normally be followed by BuildMapForDuplicatePoints, FindPoint, or FindClosestPoint. Since this will build a normal k-d tree, all the region intersection queries will still work, as will most other calls except those that have "Cell" in the name.
vtkIdTypeArray BuildMapForDuplicatePoints (float tolerance)
 This call returns a mapping from the original point IDs supplied to BuildLocatorFromPoints to a subset of those IDs that is unique within the specified tolerance. If points 2, 5, and 12 are the same, then IdMap[2] = IdMap[5] = IdMap[12] = 2 (or 5 or 12).
void CreateCellLists (int dataSetIndex, IntPtr regionReqList, int reqListSize)
 Create a list for each of the requested regions, listing the IDs of all cells whose centroid falls in the region. These lists are obtained with GetCellList(). If no DataSet is specified, the cell list is created for DataSet 0. If no list of requested regions is provided, the cell lists for all regions are created.
void CreateCellLists (vtkDataSet set, IntPtr regionReqList, int reqListSize)
 Create a list for each of the requested regions, listing the IDs of all cells whose centroid falls in the region. These lists are obtained with GetCellList(). If no DataSet is specified, the cell list is created for DataSet 0. If no list of requested regions is provided, the cell lists for all regions are created.
void CreateCellLists (IntPtr regionReqList, int listSize)
 Create a list for each of the requested regions, listing the IDs of all cells whose centroid falls in the region. These lists are obtained with GetCellList(). If no DataSet is specified, the cell list is created for DataSet 0. If no list of requested regions is provided, the cell lists for all regions are created.
void CreateCellLists ()
 Create a list for each of the requested regions, listing the IDs of all cells whose centroid falls in the region. These lists are obtained with GetCellList(). If no DataSet is specified, the cell list is created for DataSet 0. If no list of requested regions is provided, the cell lists for all regions are created.
void DeleteCellLists ()
 Free the memory used by the cell lists.
void FindClosestNPoints (int N, IntPtr x, vtkIdList result)
 Find the closest N points to a position. This returns the closest N points to a position. A faster method could be created that returned N close points to a position, but necessarily the exact N closest. The returned points are sorted from closest to farthest. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first.
int FindClosestPoint (IntPtr x, ref double dist2)
 Find the Id of the point that was previously supplied to BuildLocatorFromPoints() which is closest to the given point. Set the square of the distance between the two points.
int FindClosestPoint (double x, double y, double z, ref double dist2)
 Find the Id of the point that was previously supplied to BuildLocatorFromPoints() which is closest to the given point. Set the square of the distance between the two points.
int FindClosestPointInRegion (int regionId, IntPtr x, ref double dist2)
 Find the Id of the point in the given region which is closest to the given point. Return the ID of the point, and set the square of the distance of between the points.
int FindClosestPointInRegion (int regionId, double x, double y, double z, ref double dist2)
 Find the Id of the point in the given region which is closest to the given point. Return the ID of the point, and set the square of the distance of between the points.
int FindClosestPointWithinRadius (double radius, IntPtr x, ref double dist2)
 Given a position x and a radius r, return the id of the point closest to the point in that radius. dist2 returns the squared distance to the point.
int FindPoint (IntPtr x)
 Find the Id of the point that was previously supplied to BuildLocatorFromPoints(). Returns -1 if the point was not in the original array.
int FindPoint (double x, double y, double z)
 Find the Id of the point that was previously supplied to BuildLocatorFromPoints(). Returns -1 if the point was not in the original array.
void FindPointsInArea (IntPtr area, vtkIdTypeArray ids, bool clearArray)
 Fill ids with points found in area. The area is a 6-tuple containing (xmin, xmax, ymin, ymax, zmin, zmax). This method will clear the array by default. To append ids to an array, set clearArray to false.
void FindPointsWithinRadius (double R, IntPtr x, vtkIdList result)
 Find all points within a specified radius R of position x. The result is not sorted in any specific manner. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first.
override void FreeSearchStructure ()
 Delete the k-d tree data structure. Also delete any cell lists that were computed with CreateCellLists().
override void GenerateRepresentation (int level, vtkPolyData pd)
 Create a polydata representation of the boundaries of the k-d tree regions. If level equals GetLevel(), the leaf nodes are represented.
void GenerateRepresentation (IntPtr regionList, int len, vtkPolyData pd)
 Generate a polygonal representation of a list of regions. Only leaf nodes have region IDs, so these will be leaf nodes.
virtual void GenerateRepresentationUsingDataBoundsOff ()
 The polydata representation of the k-d tree shows the boundaries of the k-d tree decomposition spatial regions. The data inside the regions may not occupy the entire space. To draw just the bounds of the data in the regions, set this variable ON.
virtual void GenerateRepresentationUsingDataBoundsOn ()
 The polydata representation of the k-d tree shows the boundaries of the k-d tree decomposition spatial regions. The data inside the regions may not occupy the entire space. To draw just the bounds of the data in the regions, set this variable ON.
vtkIdList GetBoundaryCellList (int regionID)
 The cell list obtained with GetCellList is the list of all cells such that their centroid is contained in the spatial region. It may also be desirable to get a list of all cells intersecting a spatial region, but with centroid in some other region. This is that list. This list is computed in CreateCellLists() if and only if IncludeRegionBoundaryCells is ON. This returns a pointer to KdTree's memory, so don't free it.
void GetBounds (IntPtr bounds)
 Get the spatial bounds of the entire k-d tree space. Sets bounds array to xmin, xmax, ymin, ymax, zmin, zmax.
vtkIdList GetCellList (int regionID)
 Get the cell list for a region. This returns a pointer to vtkKdTree's memory, so don't free it.
int GetCellLists (vtkIntArray regions, int set, vtkIdList inRegionCells, vtkIdList onBoundaryCells)
 For a list of regions, get two cell lists. The first lists the IDs all cells whose centroids lie in one of the regions. The second lists the IDs of all cells that intersect the regions, but whose centroid lies in a region not on the list.
int GetCellLists (vtkIntArray regions, vtkDataSet set, vtkIdList inRegionCells, vtkIdList onBoundaryCells)
 For a list of regions, get two cell lists. The first lists the IDs all cells whose centroids lie in one of the regions. The second lists the IDs of all cells that intersect the regions, but whose centroid lies in a region not on the list.
int GetCellLists (vtkIntArray regions, vtkIdList inRegionCells, vtkIdList onBoundaryCells)
 For a list of regions, get two cell lists. The first lists the IDs all cells whose centroids lie in one of the regions. The second lists the IDs of all cells that intersect the regions, but whose centroid lies in a region not on the list.
virtual vtkBSPCuts GetCuts ()
 Get a vtkBSPCuts object, a general object representing an axis- aligned spatial partitioning. Used by vtkBSPIntersections.
vtkDataSet GetDataSet (int n)
 Return the n'th data set.
override vtkDataSet GetDataSet ()
 Return the 0'th data set. For compatability with the superclass' interface.
int GetDataSetIndex (vtkDataSet set)
 Return the index of the given data set. Returns -1 if that data set does not exist.
virtual vtkDataSetCollection GetDataSets ()
 Return a collection of all the data sets.
virtual double GetFudgeFactor ()
 Some algorithms on k-d trees require a value that is a very small distance relative to the diameter of the entire space divided by the k-d tree. This factor is the maximum axis-aligned width of the space multipled by 10e-6.
virtual int GetGenerateRepresentationUsingDataBounds ()
 The polydata representation of the k-d tree shows the boundaries of the k-d tree decomposition spatial regions. The data inside the regions may not occupy the entire space. To draw just the bounds of the data in the regions, set this variable ON.
virtual int GetIncludeRegionBoundaryCells ()
 If IncludeRegionBoundaryCells is ON, CreateCellLists() will also create a list of cells which intersect a given region, but are not assigned to the region. These lists are obtained with GetBoundaryCellList(). Default is OFF.
virtual int GetMinCells ()
 Minimum number of cells per spatial region. Default is 100.
int GetNumberOfDataSets ()
 Get the number of data sets included in spatial paritioning.
virtual int GetNumberOfRegions ()
 The number of leaf nodes of the tree, the spatial regions.
virtual int GetNumberOfRegionsOrLess ()
 Set/Get the number of spatial regions you want to get close to without going over. (The number of spatial regions is normally a power of two.) Call this before BuildLocator(). Default is unset (0).
virtual int GetNumberOfRegionsOrMore ()
 Set/Get the number of spatial regions you want to get close to while having at least this many regions. (The number of spatial regions is normally a power of two.) Default is unset (0).
vtkIdTypeArray GetPointsInRegion (int regionId)
 Get a list of the original IDs of all points in a region. You must have called BuildLocatorFromPoints before calling this.
void GetRegionBounds (int regionID, IntPtr bounds)
 Get the spatial bounds of k-d tree region.
int GetRegionContainingCell (vtkDataSet set, int cellID)
 Get the id of the region containing the cell centroid. If no DataSet is specified, assume DataSet 0. If you need the region ID for every cell, use AllGetRegionContainingCell instead. It is more efficient.
int GetRegionContainingCell (int set, int cellID)
 Get the id of the region containing the cell centroid. If no DataSet is specified, assume DataSet 0. If you need the region ID for every cell, use AllGetRegionContainingCell instead. It is more efficient.
int GetRegionContainingCell (int cellID)
 Get the id of the region containing the cell centroid. If no DataSet is specified, assume DataSet 0. If you need the region ID for every cell, use AllGetRegionContainingCell instead. It is more efficient.
int GetRegionContainingPoint (double x, double y, double z)
 Get the id of the region containing the specified location.
void GetRegionDataBounds (int regionID, IntPtr bounds)
 Get the bounds of the data within the k-d tree region.
virtual int GetTiming ()
 Turn on timing of the k-d tree build.
virtual void IncludeRegionBoundaryCellsOff ()
 If IncludeRegionBoundaryCells is ON, CreateCellLists() will also create a list of cells which intersect a given region, but are not assigned to the region. These lists are obtained with GetBoundaryCellList(). Default is OFF.
virtual void IncludeRegionBoundaryCellsOn ()
 If IncludeRegionBoundaryCells is ON, CreateCellLists() will also create a list of cells which intersect a given region, but are not assigned to the region. These lists are obtained with GetBoundaryCellList(). Default is OFF.
virtual void InvalidateGeometry ()
 Forget about the last geometry used. The next call to NewGeometry will return 1. A new k-d tree will be built the next time BuildLocator is called.
override int IsA (string type)
 Undocumented Block.
virtual int NewGeometry ()
 Return 1 if the geometry of the input data sets has changed since the last time the k-d tree was built.
new vtkKdTree NewInstance ()
 Undocumented Block.
void OmitNoPartitioning ()
 Partition along all three axes - this is the default.
void OmitXPartitioning ()
 Omit partitions along the X axis, yielding shafts in the X direction.
void OmitXYPartitioning ()
 Omit partitions along the X and Y axes, yielding slabs along Z.
void OmitYPartitioning ()
 Omit partitions along the Y axis, yielding shafts in the Y direction.
void OmitYZPartitioning ()
 Omit partitions along the Y and Z axes, yielding slabs along X.
void OmitZPartitioning ()
 Omit partitions along the Z axis, yielding shafts in the Z direction.
void OmitZXPartitioning ()
 Omit partitions along the Z and X axes, yielding slabs along Y.
void PrintRegion (int id)
 Print out leaf node data for given id.
void PrintTree ()
 Print out nodes of kd tree.
void PrintVerboseTree ()
 Print out nodes of kd tree.
virtual void RemoveAllDataSets ()
 Remove the given data set.
virtual void RemoveDataSet (int index)
 Remove the given data set.
virtual void RemoveDataSet (vtkDataSet set)
 Remove the given data set.
void SetCuts (vtkBSPCuts cuts)
 Normally the k-d tree is computed from the dataset(s) provided in SetDataSet. Alternatively, you can provide the cuts that will be applied by calling SetCuts.
override void SetDataSet (vtkDataSet set)
 Clear out all data sets and replace with single data set. For backward compatibility with superclass.
virtual void SetFudgeFactor (double _arg)
 Some algorithms on k-d trees require a value that is a very small distance relative to the diameter of the entire space divided by the k-d tree. This factor is the maximum axis-aligned width of the space multipled by 10e-6.
virtual void SetGenerateRepresentationUsingDataBounds (int _arg)
 The polydata representation of the k-d tree shows the boundaries of the k-d tree decomposition spatial regions. The data inside the regions may not occupy the entire space. To draw just the bounds of the data in the regions, set this variable ON.
virtual void SetIncludeRegionBoundaryCells (int _arg)
 If IncludeRegionBoundaryCells is ON, CreateCellLists() will also create a list of cells which intersect a given region, but are not assigned to the region. These lists are obtained with GetBoundaryCellList(). Default is OFF.
virtual void SetMinCells (int _arg)
 Minimum number of cells per spatial region. Default is 100.
void SetNewBounds (IntPtr bounds)
 There are certain applications where you want the bounds of the k-d tree space to be at least as large as a specified box. If the k-d tree has been built, you can expand it's bounds with this method. If the bounds supplied are smaller than those computed, they will be ignored.
virtual void SetNumberOfRegionsOrLess (int _arg)
 Set/Get the number of spatial regions you want to get close to without going over. (The number of spatial regions is normally a power of two.) Call this before BuildLocator(). Default is unset (0).
virtual void SetNumberOfRegionsOrMore (int _arg)
 Set/Get the number of spatial regions you want to get close to while having at least this many regions. (The number of spatial regions is normally a power of two.) Default is unset (0).
virtual void SetTiming (int _arg)
 Turn on timing of the k-d tree build.
virtual void TimingOff ()
 Turn on timing of the k-d tree build.
virtual void TimingOn ()
 Turn on timing of the k-d tree build.
int ViewOrderAllRegionsFromPosition (IntPtr directionOfProjection, vtkIntArray orderedList)
 Given a camera position (typically obtained with vtkCamera::GetPosition()), this method, creates a list of the k-d tree region IDs in order from front to back with respect to that direction. The number of ordered regions is returned. Use this method to view order regions for cameras that use perspective projection.
int ViewOrderAllRegionsInDirection (IntPtr directionOfProjection, vtkIntArray orderedList)
 Given a direction of projection (typically obtained with vtkCamera::GetDirectionOfProjection()), this method, creates a list of the k-d tree region IDs in order from front to back with respect to that direction. The number of ordered regions is returned. Use this method to view order regions for cameras that use parallel projection.
int ViewOrderRegionsFromPosition (vtkIntArray regionIds, IntPtr directionOfProjection, vtkIntArray orderedList)
 Given a camera position and a list of k-d tree region IDs, this method, creates a list of the k-d tree region IDs in order from front to back with respect to that direction. The number of ordered regions is returned. Use this method to view order regions for cameras that use perspective projection.
int ViewOrderRegionsInDirection (vtkIntArray regionIds, IntPtr directionOfProjection, vtkIntArray orderedList)
 Given a direction of projection and a list of k-d tree region IDs, this method, creates a list of the k-d tree region IDs in order from front to back with respect to that direction. The number of ordered regions is returned. Use this method to view order regions for cameras that use parallel projection.

Static Public Member Functions

static new vtkKdTree New ()
 Undocumented Block.
static vtkKdNode CopyTree (vtkKdNode kd)
 Create a copy of the binary tree representation of the k-d tree spatial partitioning provided.
static new int IsTypeOf (string type)
 Undocumented Block.
static new vtkKdTree SafeDownCast (vtkObjectBase o)
 Undocumented Block.

Public Attributes

new const string MRFullTypeName = "Kitware.VTK.vtkKdTree"
 Automatically generated type registration mechanics.

Static Public Attributes

static new readonly string MRClassNameKey = "9vtkKdTree"
 Automatically generated type registration mechanics.

Protected Member Functions

override void Dispose (bool disposing)
 Automatically generated protected Dispose method - called from public Dispose or the C# destructor. DO NOT call directly.

Private Member Functions

static internal IntPtr vtkKdTree_New (ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal void vtkKdTree_AddDataSet_01 (HandleRef pThis, HandleRef set)
static internal IntPtr vtkKdTree_AllGetRegionContainingCell_02 (HandleRef pThis)
static internal void vtkKdTree_BuildLocator_03 (HandleRef pThis)
static internal void vtkKdTree_BuildLocatorFromPoints_04 (HandleRef pThis, HandleRef pointset)
static internal void vtkKdTree_BuildLocatorFromPoints_05 (HandleRef pThis, HandleRef ptArray)
static internal IntPtr vtkKdTree_BuildMapForDuplicatePoints_06 (HandleRef pThis, float tolerance, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal IntPtr vtkKdTree_CopyTree_07 (HandleRef kd, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal void vtkKdTree_CreateCellLists_08 (HandleRef pThis, int dataSetIndex, IntPtr regionReqList, int reqListSize)
static internal void vtkKdTree_CreateCellLists_09 (HandleRef pThis, HandleRef set, IntPtr regionReqList, int reqListSize)
static internal void vtkKdTree_CreateCellLists_10 (HandleRef pThis, IntPtr regionReqList, int listSize)
static internal void vtkKdTree_CreateCellLists_11 (HandleRef pThis)
static internal void vtkKdTree_DeleteCellLists_12 (HandleRef pThis)
static internal void vtkKdTree_FindClosestNPoints_13 (HandleRef pThis, int N, IntPtr x, HandleRef result)
static internal int vtkKdTree_FindClosestPoint_14 (HandleRef pThis, IntPtr x, ref double dist2)
static internal int vtkKdTree_FindClosestPoint_15 (HandleRef pThis, double x, double y, double z, ref double dist2)
static internal int vtkKdTree_FindClosestPointInRegion_16 (HandleRef pThis, int regionId, IntPtr x, ref double dist2)
static internal int vtkKdTree_FindClosestPointInRegion_17 (HandleRef pThis, int regionId, double x, double y, double z, ref double dist2)
static internal int vtkKdTree_FindClosestPointWithinRadius_18 (HandleRef pThis, double radius, IntPtr x, ref double dist2)
static internal int vtkKdTree_FindPoint_19 (HandleRef pThis, IntPtr x)
static internal int vtkKdTree_FindPoint_20 (HandleRef pThis, double x, double y, double z)
static internal void vtkKdTree_FindPointsInArea_21 (HandleRef pThis, IntPtr area, HandleRef ids, byte clearArray)
static internal void vtkKdTree_FindPointsWithinRadius_22 (HandleRef pThis, double R, IntPtr x, HandleRef result)
static internal void vtkKdTree_FreeSearchStructure_23 (HandleRef pThis)
static internal void vtkKdTree_GenerateRepresentation_24 (HandleRef pThis, int level, HandleRef pd)
static internal void vtkKdTree_GenerateRepresentation_25 (HandleRef pThis, IntPtr regionList, int len, HandleRef pd)
static internal void vtkKdTree_GenerateRepresentationUsingDataBoundsOff_26 (HandleRef pThis)
static internal void vtkKdTree_GenerateRepresentationUsingDataBoundsOn_27 (HandleRef pThis)
static internal IntPtr vtkKdTree_GetBoundaryCellList_28 (HandleRef pThis, int regionID, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal void vtkKdTree_GetBounds_29 (HandleRef pThis, IntPtr bounds)
static internal IntPtr vtkKdTree_GetCellList_30 (HandleRef pThis, int regionID, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal int vtkKdTree_GetCellLists_31 (HandleRef pThis, HandleRef regions, int set, HandleRef inRegionCells, HandleRef onBoundaryCells)
static internal int vtkKdTree_GetCellLists_32 (HandleRef pThis, HandleRef regions, HandleRef set, HandleRef inRegionCells, HandleRef onBoundaryCells)
static internal int vtkKdTree_GetCellLists_33 (HandleRef pThis, HandleRef regions, HandleRef inRegionCells, HandleRef onBoundaryCells)
static internal IntPtr vtkKdTree_GetCuts_34 (HandleRef pThis, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal IntPtr vtkKdTree_GetDataSet_35 (HandleRef pThis, int n, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal IntPtr vtkKdTree_GetDataSet_36 (HandleRef pThis, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal int vtkKdTree_GetDataSetIndex_37 (HandleRef pThis, HandleRef set)
static internal IntPtr vtkKdTree_GetDataSets_38 (HandleRef pThis, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal double vtkKdTree_GetFudgeFactor_39 (HandleRef pThis)
static internal int vtkKdTree_GetGenerateRepresentationUsingDataBounds_40 (HandleRef pThis)
static internal int vtkKdTree_GetIncludeRegionBoundaryCells_41 (HandleRef pThis)
static internal int vtkKdTree_GetMinCells_42 (HandleRef pThis)
static internal int vtkKdTree_GetNumberOfDataSets_43 (HandleRef pThis)
static internal int vtkKdTree_GetNumberOfRegions_44 (HandleRef pThis)
static internal int vtkKdTree_GetNumberOfRegionsOrLess_45 (HandleRef pThis)
static internal int vtkKdTree_GetNumberOfRegionsOrMore_46 (HandleRef pThis)
static internal IntPtr vtkKdTree_GetPointsInRegion_47 (HandleRef pThis, int regionId, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal void vtkKdTree_GetRegionBounds_48 (HandleRef pThis, int regionID, IntPtr bounds)
static internal int vtkKdTree_GetRegionContainingCell_49 (HandleRef pThis, HandleRef set, int cellID)
static internal int vtkKdTree_GetRegionContainingCell_50 (HandleRef pThis, int set, int cellID)
static internal int vtkKdTree_GetRegionContainingCell_51 (HandleRef pThis, int cellID)
static internal int vtkKdTree_GetRegionContainingPoint_52 (HandleRef pThis, double x, double y, double z)
static internal void vtkKdTree_GetRegionDataBounds_53 (HandleRef pThis, int regionID, IntPtr bounds)
static internal int vtkKdTree_GetTiming_54 (HandleRef pThis)
static internal void vtkKdTree_IncludeRegionBoundaryCellsOff_55 (HandleRef pThis)
static internal void vtkKdTree_IncludeRegionBoundaryCellsOn_56 (HandleRef pThis)
static internal void vtkKdTree_InvalidateGeometry_57 (HandleRef pThis)
static internal int vtkKdTree_IsA_58 (HandleRef pThis, string type)
static internal int vtkKdTree_IsTypeOf_59 (string type)
static internal int vtkKdTree_NewGeometry_61 (HandleRef pThis)
static internal IntPtr vtkKdTree_NewInstance_62 (HandleRef pThis, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal void vtkKdTree_OmitNoPartitioning_63 (HandleRef pThis)
static internal void vtkKdTree_OmitXPartitioning_64 (HandleRef pThis)
static internal void vtkKdTree_OmitXYPartitioning_65 (HandleRef pThis)
static internal void vtkKdTree_OmitYPartitioning_66 (HandleRef pThis)
static internal void vtkKdTree_OmitYZPartitioning_67 (HandleRef pThis)
static internal void vtkKdTree_OmitZPartitioning_68 (HandleRef pThis)
static internal void vtkKdTree_OmitZXPartitioning_69 (HandleRef pThis)
static internal void vtkKdTree_PrintRegion_70 (HandleRef pThis, int id)
static internal void vtkKdTree_PrintTree_71 (HandleRef pThis)
static internal void vtkKdTree_PrintVerboseTree_72 (HandleRef pThis)
static internal void vtkKdTree_RemoveAllDataSets_73 (HandleRef pThis)
static internal void vtkKdTree_RemoveDataSet_74 (HandleRef pThis, int index)
static internal void vtkKdTree_RemoveDataSet_75 (HandleRef pThis, HandleRef set)
static internal IntPtr vtkKdTree_SafeDownCast_76 (HandleRef o, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal void vtkKdTree_SetCuts_77 (HandleRef pThis, HandleRef cuts)
static internal void vtkKdTree_SetDataSet_78 (HandleRef pThis, HandleRef set)
static internal void vtkKdTree_SetFudgeFactor_79 (HandleRef pThis, double _arg)
static internal void vtkKdTree_SetGenerateRepresentationUsingDataBounds_80 (HandleRef pThis, int _arg)
static internal void vtkKdTree_SetIncludeRegionBoundaryCells_81 (HandleRef pThis, int _arg)
static internal void vtkKdTree_SetMinCells_82 (HandleRef pThis, int _arg)
static internal void vtkKdTree_SetNewBounds_83 (HandleRef pThis, IntPtr bounds)
static internal void vtkKdTree_SetNumberOfRegionsOrLess_84 (HandleRef pThis, int _arg)
static internal void vtkKdTree_SetNumberOfRegionsOrMore_85 (HandleRef pThis, int _arg)
static internal void vtkKdTree_SetTiming_86 (HandleRef pThis, int _arg)
static internal void vtkKdTree_TimingOff_87 (HandleRef pThis)
static internal void vtkKdTree_TimingOn_88 (HandleRef pThis)
static internal int vtkKdTree_ViewOrderAllRegionsFromPosition_89 (HandleRef pThis, IntPtr directionOfProjection, HandleRef orderedList)
static internal int vtkKdTree_ViewOrderAllRegionsInDirection_90 (HandleRef pThis, IntPtr directionOfProjection, HandleRef orderedList)
static internal int vtkKdTree_ViewOrderRegionsFromPosition_91 (HandleRef pThis, HandleRef regionIds, IntPtr directionOfProjection, HandleRef orderedList)
static internal int vtkKdTree_ViewOrderRegionsInDirection_92 (HandleRef pThis, HandleRef regionIds, IntPtr directionOfProjection, HandleRef orderedList)

Static Private Member Functions

static vtkKdTree ()
 Automatically generated type registration mechanics.

Detailed Description

vtkKdTree - a Kd-tree spatial decomposition of a set of points

Description Given one or more vtkDataSets, create a load balancing k-d tree decomposition of the points at the center of the cells. Or, create a k-d tree point locator from a list of points.

This class can also generate a PolyData representation of the boundaries of the spatial regions in the decomposition.

It can sort the regions with respect to a viewing direction, and it can decompose a list of regions into subsets, each of which represent a convex spatial region (since many algorithms require a convex region).

If the points were derived from cells, vtkKdTree can create a list of cell Ids for each region for each data set. Two lists are available - all cells with centroid in the region, and all cells that intersect the region but whose centroid lies in another region.

For the purpose of removing duplicate points quickly from large data sets, or for finding nearby points, we added another mode for building the locator. BuildLocatorFromPoints will build a k-d tree from one or more vtkPoints objects. This can be followed by BuildMapForDuplicatePoints which returns a mapping from the original ids to a subset of the ids that is unique within a supplied tolerance, or you can use FindPoint and FindClosestPoint to locate points in the original set that the tree was built from.

vtkLocator vtkCellLocator vtkPKdTree


Constructor & Destructor Documentation

static Kitware.VTK.vtkKdTree.vtkKdTree ( ) [static, private]

Automatically generated type registration mechanics.

Kitware.VTK.vtkKdTree.vtkKdTree ( IntPtr  rawCppThis,
bool  callDisposalMethod,
bool  strong 
)

Automatically generated constructor - called from generated code. DO NOT call directly.

Undocumented Block.


Member Function Documentation

virtual void Kitware.VTK.vtkKdTree.AddDataSet ( vtkDataSet  set) [virtual]

This class can compute a spatial decomposition based on the cells in a list of one or more input data sets. Add them one at a time with this method.

Get a list (in order by data set by cell id) of the region IDs of the region containing the centroid for each cell. This is faster than calling GetRegionContainingCell for each cell in the DataSet. vtkKdTree uses this list, so don't delete it.

override void Kitware.VTK.vtkKdTree.BuildLocator ( ) [virtual]

Create the k-d tree decomposition of the cells of the data set or data sets. Cells are assigned to k-d tree spatial regions based on the location of their centroids.

Reimplemented from Kitware.VTK.vtkLocator.

Reimplemented in Kitware.VTK.vtkPKdTree.

This is a special purpose locator that builds a k-d tree to find duplicate and near-by points. It builds the tree from one or more vtkPoints objects instead of from the cells of a vtkDataSet. This build would normally be followed by BuildMapForDuplicatePoints, FindPoint, or FindClosestPoint. Since this will build a normal k-d tree, all the region intersection queries will still work, as will most other calls except those that have "Cell" in the name.

This method works most efficiently when the point arrays are float arrays.

This is a special purpose locator that builds a k-d tree to find duplicate and near-by points. It builds the tree from one or more vtkPoints objects instead of from the cells of a vtkDataSet. This build would normally be followed by BuildMapForDuplicatePoints, FindPoint, or FindClosestPoint. Since this will build a normal k-d tree, all the region intersection queries will still work, as will most other calls except those that have "Cell" in the name.

This method works most efficiently when the point arrays are float arrays.

This call returns a mapping from the original point IDs supplied to BuildLocatorFromPoints to a subset of those IDs that is unique within the specified tolerance. If points 2, 5, and 12 are the same, then IdMap[2] = IdMap[5] = IdMap[12] = 2 (or 5 or 12).

"original point IDs" - For point IDs we start at 0 for the first point in the first vtkPoints object, and increase by 1 for subsequent points and subsequent vtkPoints objects.

You must have called BuildLocatorFromPoints() before calling this. You are responsible for deleting the returned array.

Here is the call graph for this function:

Create a copy of the binary tree representation of the k-d tree spatial partitioning provided.

Here is the call graph for this function:

void Kitware.VTK.vtkKdTree.CreateCellLists ( int  dataSetIndex,
IntPtr  regionReqList,
int  reqListSize 
)

Create a list for each of the requested regions, listing the IDs of all cells whose centroid falls in the region. These lists are obtained with GetCellList(). If no DataSet is specified, the cell list is created for DataSet 0. If no list of requested regions is provided, the cell lists for all regions are created.

When CreateCellLists is called again, the lists created on the previous call are deleted.

void Kitware.VTK.vtkKdTree.CreateCellLists ( vtkDataSet  set,
IntPtr  regionReqList,
int  reqListSize 
)

Create a list for each of the requested regions, listing the IDs of all cells whose centroid falls in the region. These lists are obtained with GetCellList(). If no DataSet is specified, the cell list is created for DataSet 0. If no list of requested regions is provided, the cell lists for all regions are created.

When CreateCellLists is called again, the lists created on the previous call are deleted.

void Kitware.VTK.vtkKdTree.CreateCellLists ( IntPtr  regionReqList,
int  listSize 
)

Create a list for each of the requested regions, listing the IDs of all cells whose centroid falls in the region. These lists are obtained with GetCellList(). If no DataSet is specified, the cell list is created for DataSet 0. If no list of requested regions is provided, the cell lists for all regions are created.

When CreateCellLists is called again, the lists created on the previous call are deleted.

Create a list for each of the requested regions, listing the IDs of all cells whose centroid falls in the region. These lists are obtained with GetCellList(). If no DataSet is specified, the cell list is created for DataSet 0. If no list of requested regions is provided, the cell lists for all regions are created.

When CreateCellLists is called again, the lists created on the previous call are deleted.

Free the memory used by the cell lists.

override void Kitware.VTK.vtkKdTree.Dispose ( bool  disposing) [protected]

Automatically generated protected Dispose method - called from public Dispose or the C# destructor. DO NOT call directly.

Reimplemented from Kitware.VTK.vtkLocator.

Reimplemented in Kitware.VTK.vtkPKdTree.

void Kitware.VTK.vtkKdTree.FindClosestNPoints ( int  N,
IntPtr  x,
vtkIdList  result 
)

Find the closest N points to a position. This returns the closest N points to a position. A faster method could be created that returned N close points to a position, but necessarily the exact N closest. The returned points are sorted from closest to farthest. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first.

int Kitware.VTK.vtkKdTree.FindClosestPoint ( IntPtr  x,
ref double  dist2 
)

Find the Id of the point that was previously supplied to BuildLocatorFromPoints() which is closest to the given point. Set the square of the distance between the two points.

int Kitware.VTK.vtkKdTree.FindClosestPoint ( double  x,
double  y,
double  z,
ref double  dist2 
)

Find the Id of the point that was previously supplied to BuildLocatorFromPoints() which is closest to the given point. Set the square of the distance between the two points.

int Kitware.VTK.vtkKdTree.FindClosestPointInRegion ( int  regionId,
IntPtr  x,
ref double  dist2 
)

Find the Id of the point in the given region which is closest to the given point. Return the ID of the point, and set the square of the distance of between the points.

int Kitware.VTK.vtkKdTree.FindClosestPointInRegion ( int  regionId,
double  x,
double  y,
double  z,
ref double  dist2 
)

Find the Id of the point in the given region which is closest to the given point. Return the ID of the point, and set the square of the distance of between the points.

int Kitware.VTK.vtkKdTree.FindClosestPointWithinRadius ( double  radius,
IntPtr  x,
ref double  dist2 
)

Given a position x and a radius r, return the id of the point closest to the point in that radius. dist2 returns the squared distance to the point.

Find the Id of the point that was previously supplied to BuildLocatorFromPoints(). Returns -1 if the point was not in the original array.

int Kitware.VTK.vtkKdTree.FindPoint ( double  x,
double  y,
double  z 
)

Find the Id of the point that was previously supplied to BuildLocatorFromPoints(). Returns -1 if the point was not in the original array.

void Kitware.VTK.vtkKdTree.FindPointsInArea ( IntPtr  area,
vtkIdTypeArray  ids,
bool  clearArray 
)

Fill ids with points found in area. The area is a 6-tuple containing (xmin, xmax, ymin, ymax, zmin, zmax). This method will clear the array by default. To append ids to an array, set clearArray to false.

void Kitware.VTK.vtkKdTree.FindPointsWithinRadius ( double  R,
IntPtr  x,
vtkIdList  result 
)

Find all points within a specified radius R of position x. The result is not sorted in any specific manner. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first.

override void Kitware.VTK.vtkKdTree.FreeSearchStructure ( ) [virtual]

Delete the k-d tree data structure. Also delete any cell lists that were computed with CreateCellLists().

Reimplemented from Kitware.VTK.vtkLocator.

override void Kitware.VTK.vtkKdTree.GenerateRepresentation ( int  level,
vtkPolyData  pd 
) [virtual]

Create a polydata representation of the boundaries of the k-d tree regions. If level equals GetLevel(), the leaf nodes are represented.

Reimplemented from Kitware.VTK.vtkLocator.

void Kitware.VTK.vtkKdTree.GenerateRepresentation ( IntPtr  regionList,
int  len,
vtkPolyData  pd 
)

Generate a polygonal representation of a list of regions. Only leaf nodes have region IDs, so these will be leaf nodes.

The polydata representation of the k-d tree shows the boundaries of the k-d tree decomposition spatial regions. The data inside the regions may not occupy the entire space. To draw just the bounds of the data in the regions, set this variable ON.

The polydata representation of the k-d tree shows the boundaries of the k-d tree decomposition spatial regions. The data inside the regions may not occupy the entire space. To draw just the bounds of the data in the regions, set this variable ON.

The cell list obtained with GetCellList is the list of all cells such that their centroid is contained in the spatial region. It may also be desirable to get a list of all cells intersecting a spatial region, but with centroid in some other region. This is that list. This list is computed in CreateCellLists() if and only if IncludeRegionBoundaryCells is ON. This returns a pointer to KdTree's memory, so don't free it.

Here is the call graph for this function:

void Kitware.VTK.vtkKdTree.GetBounds ( IntPtr  bounds)

Get the spatial bounds of the entire k-d tree space. Sets bounds array to xmin, xmax, ymin, ymax, zmin, zmax.

Get the cell list for a region. This returns a pointer to vtkKdTree's memory, so don't free it.

Here is the call graph for this function:

int Kitware.VTK.vtkKdTree.GetCellLists ( vtkIntArray  regions,
int  set,
vtkIdList  inRegionCells,
vtkIdList  onBoundaryCells 
)

For a list of regions, get two cell lists. The first lists the IDs all cells whose centroids lie in one of the regions. The second lists the IDs of all cells that intersect the regions, but whose centroid lies in a region not on the list.

The total number of cell IDs written to both lists is returned. Either list pointer passed in can be NULL, and it will be ignored. If there are multiple data sets, you must specify which data set you wish cell IDs for.

The caller should delete these two lists when done. This method uses the cell lists created in CreateCellLists(). If the cell list for any of the requested regions does not exist, then this method will call CreateCellLists() to create cell lists for *every* region of the k-d tree. You must remember to DeleteCellLists() when done with all calls to this method, as cell lists can require a great deal of memory.

int Kitware.VTK.vtkKdTree.GetCellLists ( vtkIntArray  regions,
vtkDataSet  set,
vtkIdList  inRegionCells,
vtkIdList  onBoundaryCells 
)

For a list of regions, get two cell lists. The first lists the IDs all cells whose centroids lie in one of the regions. The second lists the IDs of all cells that intersect the regions, but whose centroid lies in a region not on the list.

The total number of cell IDs written to both lists is returned. Either list pointer passed in can be NULL, and it will be ignored. If there are multiple data sets, you must specify which data set you wish cell IDs for.

The caller should delete these two lists when done. This method uses the cell lists created in CreateCellLists(). If the cell list for any of the requested regions does not exist, then this method will call CreateCellLists() to create cell lists for *every* region of the k-d tree. You must remember to DeleteCellLists() when done with all calls to this method, as cell lists can require a great deal of memory.

int Kitware.VTK.vtkKdTree.GetCellLists ( vtkIntArray  regions,
vtkIdList  inRegionCells,
vtkIdList  onBoundaryCells 
)

For a list of regions, get two cell lists. The first lists the IDs all cells whose centroids lie in one of the regions. The second lists the IDs of all cells that intersect the regions, but whose centroid lies in a region not on the list.

The total number of cell IDs written to both lists is returned. Either list pointer passed in can be NULL, and it will be ignored. If there are multiple data sets, you must specify which data set you wish cell IDs for.

The caller should delete these two lists when done. This method uses the cell lists created in CreateCellLists(). If the cell list for any of the requested regions does not exist, then this method will call CreateCellLists() to create cell lists for *every* region of the k-d tree. You must remember to DeleteCellLists() when done with all calls to this method, as cell lists can require a great deal of memory.

Get a vtkBSPCuts object, a general object representing an axis- aligned spatial partitioning. Used by vtkBSPIntersections.

Here is the call graph for this function:

Return the n'th data set.

Here is the call graph for this function:

Return the 0'th data set. For compatability with the superclass' interface.

Reimplemented from Kitware.VTK.vtkLocator.

Here is the call graph for this function:

Return the index of the given data set. Returns -1 if that data set does not exist.

Return a collection of all the data sets.

Here is the call graph for this function:

virtual double Kitware.VTK.vtkKdTree.GetFudgeFactor ( ) [virtual]

Some algorithms on k-d trees require a value that is a very small distance relative to the diameter of the entire space divided by the k-d tree. This factor is the maximum axis-aligned width of the space multipled by 10e-6.

The polydata representation of the k-d tree shows the boundaries of the k-d tree decomposition spatial regions. The data inside the regions may not occupy the entire space. To draw just the bounds of the data in the regions, set this variable ON.

If IncludeRegionBoundaryCells is ON, CreateCellLists() will also create a list of cells which intersect a given region, but are not assigned to the region. These lists are obtained with GetBoundaryCellList(). Default is OFF.

virtual int Kitware.VTK.vtkKdTree.GetMinCells ( ) [virtual]

Minimum number of cells per spatial region. Default is 100.

Get the number of data sets included in spatial paritioning.

virtual int Kitware.VTK.vtkKdTree.GetNumberOfRegions ( ) [virtual]

The number of leaf nodes of the tree, the spatial regions.

Set/Get the number of spatial regions you want to get close to without going over. (The number of spatial regions is normally a power of two.) Call this before BuildLocator(). Default is unset (0).

Set/Get the number of spatial regions you want to get close to while having at least this many regions. (The number of spatial regions is normally a power of two.) Default is unset (0).

Get a list of the original IDs of all points in a region. You must have called BuildLocatorFromPoints before calling this.

Here is the call graph for this function:

void Kitware.VTK.vtkKdTree.GetRegionBounds ( int  regionID,
IntPtr  bounds 
)

Get the spatial bounds of k-d tree region.

Get the id of the region containing the cell centroid. If no DataSet is specified, assume DataSet 0. If you need the region ID for every cell, use AllGetRegionContainingCell instead. It is more efficient.

int Kitware.VTK.vtkKdTree.GetRegionContainingCell ( int  set,
int  cellID 
)

Get the id of the region containing the cell centroid. If no DataSet is specified, assume DataSet 0. If you need the region ID for every cell, use AllGetRegionContainingCell instead. It is more efficient.

Get the id of the region containing the cell centroid. If no DataSet is specified, assume DataSet 0. If you need the region ID for every cell, use AllGetRegionContainingCell instead. It is more efficient.

int Kitware.VTK.vtkKdTree.GetRegionContainingPoint ( double  x,
double  y,
double  z 
)

Get the id of the region containing the specified location.

void Kitware.VTK.vtkKdTree.GetRegionDataBounds ( int  regionID,
IntPtr  bounds 
)

Get the bounds of the data within the k-d tree region.

virtual int Kitware.VTK.vtkKdTree.GetTiming ( ) [virtual]

Turn on timing of the k-d tree build.

If IncludeRegionBoundaryCells is ON, CreateCellLists() will also create a list of cells which intersect a given region, but are not assigned to the region. These lists are obtained with GetBoundaryCellList(). Default is OFF.

If IncludeRegionBoundaryCells is ON, CreateCellLists() will also create a list of cells which intersect a given region, but are not assigned to the region. These lists are obtained with GetBoundaryCellList(). Default is OFF.

virtual void Kitware.VTK.vtkKdTree.InvalidateGeometry ( ) [virtual]

Forget about the last geometry used. The next call to NewGeometry will return 1. A new k-d tree will be built the next time BuildLocator is called.

override int Kitware.VTK.vtkKdTree.IsA ( string  type) [virtual]

Undocumented Block.

Reimplemented from Kitware.VTK.vtkLocator.

Reimplemented in Kitware.VTK.vtkPKdTree.

static new int Kitware.VTK.vtkKdTree.IsTypeOf ( string  type) [static]

Undocumented Block.

Reimplemented from Kitware.VTK.vtkLocator.

Reimplemented in Kitware.VTK.vtkPKdTree.

static new vtkKdTree Kitware.VTK.vtkKdTree.New ( ) [static]

Undocumented Block.

Reimplemented from Kitware.VTK.vtkObject.

Reimplemented in Kitware.VTK.vtkPKdTree.

virtual int Kitware.VTK.vtkKdTree.NewGeometry ( ) [virtual]

Return 1 if the geometry of the input data sets has changed since the last time the k-d tree was built.

Undocumented Block.

Reimplemented from Kitware.VTK.vtkLocator.

Reimplemented in Kitware.VTK.vtkPKdTree.

Partition along all three axes - this is the default.

Omit partitions along the X axis, yielding shafts in the X direction.

Omit partitions along the X and Y axes, yielding slabs along Z.

Omit partitions along the Y axis, yielding shafts in the Y direction.

Omit partitions along the Y and Z axes, yielding slabs along X.

Omit partitions along the Z axis, yielding shafts in the Z direction.

Omit partitions along the Z and X axes, yielding slabs along Y.

Print out leaf node data for given id.

Print out nodes of kd tree.

Print out nodes of kd tree.

virtual void Kitware.VTK.vtkKdTree.RemoveAllDataSets ( ) [virtual]

Remove the given data set.

virtual void Kitware.VTK.vtkKdTree.RemoveDataSet ( int  index) [virtual]

Remove the given data set.

virtual void Kitware.VTK.vtkKdTree.RemoveDataSet ( vtkDataSet  set) [virtual]

Remove the given data set.

Undocumented Block.

Reimplemented from Kitware.VTK.vtkLocator.

Reimplemented in Kitware.VTK.vtkPKdTree.

Here is the call graph for this function:

Normally the k-d tree is computed from the dataset(s) provided in SetDataSet. Alternatively, you can provide the cuts that will be applied by calling SetCuts.

override void Kitware.VTK.vtkKdTree.SetDataSet ( vtkDataSet  set) [virtual]

Clear out all data sets and replace with single data set. For backward compatibility with superclass.

Reimplemented from Kitware.VTK.vtkLocator.

virtual void Kitware.VTK.vtkKdTree.SetFudgeFactor ( double  _arg) [virtual]

Some algorithms on k-d trees require a value that is a very small distance relative to the diameter of the entire space divided by the k-d tree. This factor is the maximum axis-aligned width of the space multipled by 10e-6.

The polydata representation of the k-d tree shows the boundaries of the k-d tree decomposition spatial regions. The data inside the regions may not occupy the entire space. To draw just the bounds of the data in the regions, set this variable ON.

virtual void Kitware.VTK.vtkKdTree.SetIncludeRegionBoundaryCells ( int  _arg) [virtual]

If IncludeRegionBoundaryCells is ON, CreateCellLists() will also create a list of cells which intersect a given region, but are not assigned to the region. These lists are obtained with GetBoundaryCellList(). Default is OFF.

virtual void Kitware.VTK.vtkKdTree.SetMinCells ( int  _arg) [virtual]

Minimum number of cells per spatial region. Default is 100.

void Kitware.VTK.vtkKdTree.SetNewBounds ( IntPtr  bounds)

There are certain applications where you want the bounds of the k-d tree space to be at least as large as a specified box. If the k-d tree has been built, you can expand it's bounds with this method. If the bounds supplied are smaller than those computed, they will be ignored.

virtual void Kitware.VTK.vtkKdTree.SetNumberOfRegionsOrLess ( int  _arg) [virtual]

Set/Get the number of spatial regions you want to get close to without going over. (The number of spatial regions is normally a power of two.) Call this before BuildLocator(). Default is unset (0).

virtual void Kitware.VTK.vtkKdTree.SetNumberOfRegionsOrMore ( int  _arg) [virtual]

Set/Get the number of spatial regions you want to get close to while having at least this many regions. (The number of spatial regions is normally a power of two.) Default is unset (0).

virtual void Kitware.VTK.vtkKdTree.SetTiming ( int  _arg) [virtual]

Turn on timing of the k-d tree build.

virtual void Kitware.VTK.vtkKdTree.TimingOff ( ) [virtual]

Turn on timing of the k-d tree build.

virtual void Kitware.VTK.vtkKdTree.TimingOn ( ) [virtual]

Turn on timing of the k-d tree build.

int Kitware.VTK.vtkKdTree.ViewOrderAllRegionsFromPosition ( IntPtr  directionOfProjection,
vtkIntArray  orderedList 
)

Given a camera position (typically obtained with vtkCamera::GetPosition()), this method, creates a list of the k-d tree region IDs in order from front to back with respect to that direction. The number of ordered regions is returned. Use this method to view order regions for cameras that use perspective projection.

int Kitware.VTK.vtkKdTree.ViewOrderAllRegionsInDirection ( IntPtr  directionOfProjection,
vtkIntArray  orderedList 
)

Given a direction of projection (typically obtained with vtkCamera::GetDirectionOfProjection()), this method, creates a list of the k-d tree region IDs in order from front to back with respect to that direction. The number of ordered regions is returned. Use this method to view order regions for cameras that use parallel projection.

int Kitware.VTK.vtkKdTree.ViewOrderRegionsFromPosition ( vtkIntArray  regionIds,
IntPtr  directionOfProjection,
vtkIntArray  orderedList 
)

Given a camera position and a list of k-d tree region IDs, this method, creates a list of the k-d tree region IDs in order from front to back with respect to that direction. The number of ordered regions is returned. Use this method to view order regions for cameras that use perspective projection.

int Kitware.VTK.vtkKdTree.ViewOrderRegionsInDirection ( vtkIntArray  regionIds,
IntPtr  directionOfProjection,
vtkIntArray  orderedList 
)

Given a direction of projection and a list of k-d tree region IDs, this method, creates a list of the k-d tree region IDs in order from front to back with respect to that direction. The number of ordered regions is returned. Use this method to view order regions for cameras that use parallel projection.

static internal void Kitware.VTK.vtkKdTree.vtkKdTree_AddDataSet_01 ( HandleRef  pThis,
HandleRef  set 
) [private]
static internal IntPtr Kitware.VTK.vtkKdTree.vtkKdTree_AllGetRegionContainingCell_02 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_BuildLocator_03 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_BuildLocatorFromPoints_04 ( HandleRef  pThis,
HandleRef  pointset 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_BuildLocatorFromPoints_05 ( HandleRef  pThis,
HandleRef  ptArray 
) [private]
static internal IntPtr Kitware.VTK.vtkKdTree.vtkKdTree_BuildMapForDuplicatePoints_06 ( HandleRef  pThis,
float  tolerance,
ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal IntPtr Kitware.VTK.vtkKdTree.vtkKdTree_CopyTree_07 ( HandleRef  kd,
ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_CreateCellLists_08 ( HandleRef  pThis,
int  dataSetIndex,
IntPtr  regionReqList,
int  reqListSize 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_CreateCellLists_09 ( HandleRef  pThis,
HandleRef  set,
IntPtr  regionReqList,
int  reqListSize 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_CreateCellLists_10 ( HandleRef  pThis,
IntPtr  regionReqList,
int  listSize 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_CreateCellLists_11 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_DeleteCellLists_12 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_FindClosestNPoints_13 ( HandleRef  pThis,
int  N,
IntPtr  x,
HandleRef  result 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_FindClosestPoint_14 ( HandleRef  pThis,
IntPtr  x,
ref double  dist2 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_FindClosestPoint_15 ( HandleRef  pThis,
double  x,
double  y,
double  z,
ref double  dist2 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_FindClosestPointInRegion_16 ( HandleRef  pThis,
int  regionId,
IntPtr  x,
ref double  dist2 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_FindClosestPointInRegion_17 ( HandleRef  pThis,
int  regionId,
double  x,
double  y,
double  z,
ref double  dist2 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_FindClosestPointWithinRadius_18 ( HandleRef  pThis,
double  radius,
IntPtr  x,
ref double  dist2 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_FindPoint_19 ( HandleRef  pThis,
IntPtr  x 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_FindPoint_20 ( HandleRef  pThis,
double  x,
double  y,
double  z 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_FindPointsInArea_21 ( HandleRef  pThis,
IntPtr  area,
HandleRef  ids,
byte  clearArray 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_FindPointsWithinRadius_22 ( HandleRef  pThis,
double  R,
IntPtr  x,
HandleRef  result 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_FreeSearchStructure_23 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_GenerateRepresentation_24 ( HandleRef  pThis,
int  level,
HandleRef  pd 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_GenerateRepresentation_25 ( HandleRef  pThis,
IntPtr  regionList,
int  len,
HandleRef  pd 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_GenerateRepresentationUsingDataBoundsOff_26 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_GenerateRepresentationUsingDataBoundsOn_27 ( HandleRef  pThis) [private]
static internal IntPtr Kitware.VTK.vtkKdTree.vtkKdTree_GetBoundaryCellList_28 ( HandleRef  pThis,
int  regionID,
ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_GetBounds_29 ( HandleRef  pThis,
IntPtr  bounds 
) [private]
static internal IntPtr Kitware.VTK.vtkKdTree.vtkKdTree_GetCellList_30 ( HandleRef  pThis,
int  regionID,
ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_GetCellLists_31 ( HandleRef  pThis,
HandleRef  regions,
int  set,
HandleRef  inRegionCells,
HandleRef  onBoundaryCells 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_GetCellLists_32 ( HandleRef  pThis,
HandleRef  regions,
HandleRef  set,
HandleRef  inRegionCells,
HandleRef  onBoundaryCells 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_GetCellLists_33 ( HandleRef  pThis,
HandleRef  regions,
HandleRef  inRegionCells,
HandleRef  onBoundaryCells 
) [private]
static internal IntPtr Kitware.VTK.vtkKdTree.vtkKdTree_GetCuts_34 ( HandleRef  pThis,
ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal IntPtr Kitware.VTK.vtkKdTree.vtkKdTree_GetDataSet_35 ( HandleRef  pThis,
int  n,
ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal IntPtr Kitware.VTK.vtkKdTree.vtkKdTree_GetDataSet_36 ( HandleRef  pThis,
ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_GetDataSetIndex_37 ( HandleRef  pThis,
HandleRef  set 
) [private]
static internal IntPtr Kitware.VTK.vtkKdTree.vtkKdTree_GetDataSets_38 ( HandleRef  pThis,
ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal double Kitware.VTK.vtkKdTree.vtkKdTree_GetFudgeFactor_39 ( HandleRef  pThis) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_GetGenerateRepresentationUsingDataBounds_40 ( HandleRef  pThis) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_GetIncludeRegionBoundaryCells_41 ( HandleRef  pThis) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_GetMinCells_42 ( HandleRef  pThis) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_GetNumberOfDataSets_43 ( HandleRef  pThis) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_GetNumberOfRegions_44 ( HandleRef  pThis) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_GetNumberOfRegionsOrLess_45 ( HandleRef  pThis) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_GetNumberOfRegionsOrMore_46 ( HandleRef  pThis) [private]
static internal IntPtr Kitware.VTK.vtkKdTree.vtkKdTree_GetPointsInRegion_47 ( HandleRef  pThis,
int  regionId,
ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_GetRegionBounds_48 ( HandleRef  pThis,
int  regionID,
IntPtr  bounds 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_GetRegionContainingCell_49 ( HandleRef  pThis,
HandleRef  set,
int  cellID 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_GetRegionContainingCell_50 ( HandleRef  pThis,
int  set,
int  cellID 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_GetRegionContainingCell_51 ( HandleRef  pThis,
int  cellID 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_GetRegionContainingPoint_52 ( HandleRef  pThis,
double  x,
double  y,
double  z 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_GetRegionDataBounds_53 ( HandleRef  pThis,
int  regionID,
IntPtr  bounds 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_GetTiming_54 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_IncludeRegionBoundaryCellsOff_55 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_IncludeRegionBoundaryCellsOn_56 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_InvalidateGeometry_57 ( HandleRef  pThis) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_IsA_58 ( HandleRef  pThis,
string  type 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_IsTypeOf_59 ( string  type) [private]
static internal IntPtr Kitware.VTK.vtkKdTree.vtkKdTree_New ( ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_NewGeometry_61 ( HandleRef  pThis) [private]
static internal IntPtr Kitware.VTK.vtkKdTree.vtkKdTree_NewInstance_62 ( HandleRef  pThis,
ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_OmitNoPartitioning_63 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_OmitXPartitioning_64 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_OmitXYPartitioning_65 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_OmitYPartitioning_66 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_OmitYZPartitioning_67 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_OmitZPartitioning_68 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_OmitZXPartitioning_69 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_PrintRegion_70 ( HandleRef  pThis,
int  id 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_PrintTree_71 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_PrintVerboseTree_72 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_RemoveAllDataSets_73 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_RemoveDataSet_74 ( HandleRef  pThis,
int  index 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_RemoveDataSet_75 ( HandleRef  pThis,
HandleRef  set 
) [private]
static internal IntPtr Kitware.VTK.vtkKdTree.vtkKdTree_SafeDownCast_76 ( HandleRef  o,
ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_SetCuts_77 ( HandleRef  pThis,
HandleRef  cuts 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_SetDataSet_78 ( HandleRef  pThis,
HandleRef  set 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_SetFudgeFactor_79 ( HandleRef  pThis,
double  _arg 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_SetGenerateRepresentationUsingDataBounds_80 ( HandleRef  pThis,
int  _arg 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_SetIncludeRegionBoundaryCells_81 ( HandleRef  pThis,
int  _arg 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_SetMinCells_82 ( HandleRef  pThis,
int  _arg 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_SetNewBounds_83 ( HandleRef  pThis,
IntPtr  bounds 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_SetNumberOfRegionsOrLess_84 ( HandleRef  pThis,
int  _arg 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_SetNumberOfRegionsOrMore_85 ( HandleRef  pThis,
int  _arg 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_SetTiming_86 ( HandleRef  pThis,
int  _arg 
) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_TimingOff_87 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkKdTree.vtkKdTree_TimingOn_88 ( HandleRef  pThis) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_ViewOrderAllRegionsFromPosition_89 ( HandleRef  pThis,
IntPtr  directionOfProjection,
HandleRef  orderedList 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_ViewOrderAllRegionsInDirection_90 ( HandleRef  pThis,
IntPtr  directionOfProjection,
HandleRef  orderedList 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_ViewOrderRegionsFromPosition_91 ( HandleRef  pThis,
HandleRef  regionIds,
IntPtr  directionOfProjection,
HandleRef  orderedList 
) [private]
static internal int Kitware.VTK.vtkKdTree.vtkKdTree_ViewOrderRegionsInDirection_92 ( HandleRef  pThis,
HandleRef  regionIds,
IntPtr  directionOfProjection,
HandleRef  orderedList 
) [private]

Member Data Documentation

new readonly string Kitware.VTK.vtkKdTree.MRClassNameKey = "9vtkKdTree" [static]

Automatically generated type registration mechanics.

Reimplemented from Kitware.VTK.vtkLocator.

Reimplemented in Kitware.VTK.vtkPKdTree.

new const string Kitware.VTK.vtkKdTree.MRFullTypeName = "Kitware.VTK.vtkKdTree"

Automatically generated type registration mechanics.

Reimplemented from Kitware.VTK.vtkLocator.

Reimplemented in Kitware.VTK.vtkPKdTree.


The documentation for this class was generated from the following file: