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.vtkAbstractCellLocator Class Reference

vtkAbstractCellLocator - an abstract base class for locators which find cells More...

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

List of all members.

Public Member Functions

 vtkAbstractCellLocator (IntPtr rawCppThis, bool callDisposalMethod, bool strong)
 Automatically generated constructor - called from generated code. DO NOT call directly.
virtual void CacheCellBoundsOff ()
 Boolean controls whether the bounds of each cell are computed only once and then saved. Should be 10 to 20% faster if repeatedly calling any of the Intersect/Find routines and the extra memory won't cause disk caching (24 extra bytes per cell are required to save the bounds).
virtual void CacheCellBoundsOn ()
 Boolean controls whether the bounds of each cell are computed only once and then saved. Should be 10 to 20% faster if repeatedly calling any of the Intersect/Find routines and the extra memory won't cause disk caching (24 extra bytes per cell are required to save the bounds).
virtual int FindCell (IntPtr x)
 Returns the Id of the cell containing the point, returns -1 if no cell found. This interface uses a tolerance of zero.
virtual int FindCell (IntPtr x, double tol2, vtkGenericCell GenCell, IntPtr pcoords, IntPtr weights)
 Find the cell containing a given point. returns -1 if no cell found the cell parameters are copied into the supplied variables, a cell must be provided to store the information.
virtual void FindCellsAlongLine (IntPtr p1, IntPtr p2, double tolerance, vtkIdList cells)
 Given a finite line defined by the two points (p1,p2), return the list of unique cell ids in the buckets containing the line. It is possible that an empty cell list is returned. The user must provide the vtkIdList to populate. This method returns data only after the locator has been built.
virtual void FindCellsWithinBounds (IntPtr bbox, vtkIdList cells)
 Return a list of unique cell ids inside of a given bounding box. The user must provide the vtkIdList to populate. This method returns data only after the locator has been built.
virtual void FindClosestPoint (IntPtr x, IntPtr closestPoint, ref int cellId, ref int subId, ref double dist2)
 Return the closest point and the cell which is closest to the point x. The closest point is somewhere on a cell, it need not be one of the vertices of the cell.
virtual void FindClosestPoint (IntPtr x, IntPtr closestPoint, vtkGenericCell cell, ref int cellId, ref int subId, ref double dist2)
 Return the closest point and the cell which is closest to the point x. The closest point is somewhere on a cell, it need not be one of the vertices of the cell. This version takes in a vtkGenericCell to avoid allocating and deallocating the cell. This is much faster than the version which does not take a *cell, especially when this function is called many times in a row such as by a for loop, where the allocation and deallocation can be done only once outside the for loop. If a cell is found, "cell" contains the points and ptIds for the cell "cellId" upon exit.
virtual int FindClosestPointWithinRadius (IntPtr x, double radius, IntPtr closestPoint, ref int cellId, ref int subId, ref double dist2)
 Return the closest point within a specified radius and the cell which is closest to the point x. The closest point is somewhere on a cell, it need not be one of the vertices of the cell. This method returns 1 if a point is found within the specified radius. If there are no cells within the specified radius, the method returns 0 and the values of closestPoint, cellId, subId, and dist2 are undefined.
virtual int FindClosestPointWithinRadius (IntPtr x, double radius, IntPtr closestPoint, vtkGenericCell cell, ref int cellId, ref int subId, ref double dist2)
 Return the closest point within a specified radius and the cell which is closest to the point x. The closest point is somewhere on a cell, it need not be one of the vertices of the cell. This method returns 1 if a point is found within the specified radius. If there are no cells within the specified radius, the method returns 0 and the values of closestPoint, cellId, subId, and dist2 are undefined. This version takes in a vtkGenericCell to avoid allocating and deallocating the cell. This is much faster than the version which does not take a *cell, especially when this function is called many times in a row such as by a for loop, where the allocation and deallocation can be done only once outside the for loop. If a closest point is found, "cell" contains the points and ptIds for the cell "cellId" upon exit.
virtual int FindClosestPointWithinRadius (IntPtr x, double radius, IntPtr closestPoint, vtkGenericCell cell, ref int cellId, ref int subId, ref double dist2, ref int inside)
 Return the closest point within a specified radius and the cell which is closest to the point x. The closest point is somewhere on a cell, it need not be one of the vertices of the cell. This method returns 1 if a point is found within the specified radius. If there are no cells within the specified radius, the method returns 0 and the values of closestPoint, cellId, subId, and dist2 are undefined. This version takes in a vtkGenericCell to avoid allocating and deallocating the cell. This is much faster than the version which does not take a *cell, especially when this function is called many times in a row such as by a for loop, where the allocation and dealloction can be done only once outside the for loop. If a closest point is found, "cell" contains the points and ptIds for the cell "cellId" upon exit. If a closest point is found, inside returns the return value of the EvaluatePosition call to the closest cell; inside(=1) or outside(=0).
virtual int GetCacheCellBounds ()
 Boolean controls whether the bounds of each cell are computed only once and then saved. Should be 10 to 20% faster if repeatedly calling any of the Intersect/Find routines and the extra memory won't cause disk caching (24 extra bytes per cell are required to save the bounds).
virtual int GetLazyEvaluation ()
 Most Locators build their search structures during BuildLocator but some may delay construction until it is actually needed. If LazyEvaluation is supported, this turns on/off the feature. if not supported, it is ignored.
virtual int GetNumberOfCellsPerNode ()
 Specify the preferred/maximum number of cells in each node/bucket. Default 32. Locators generally operate by subdividing space into smaller regions until the number of cells in each region (or node) reaches the desired level.
virtual int GetNumberOfCellsPerNodeMaxValue ()
 Specify the preferred/maximum number of cells in each node/bucket. Default 32. Locators generally operate by subdividing space into smaller regions until the number of cells in each region (or node) reaches the desired level.
virtual int GetNumberOfCellsPerNodeMinValue ()
 Specify the preferred/maximum number of cells in each node/bucket. Default 32. Locators generally operate by subdividing space into smaller regions until the number of cells in each region (or node) reaches the desired level.
virtual int GetRetainCellLists ()
 Boolean controls whether to maintain list of cells in each node. not applicable to all implementations, but if the locator is being used as a geometry simplification technique, there is no need to keep them.
virtual int GetUseExistingSearchStructure ()
 Some locators support querying a new dataset without rebuilding the search structure (typically this may occur when a dataset changes due to a time update, but is actually the same topology) Turning on this flag enables some locators to skip the rebuilding phase.
virtual bool InsideCellBounds (IntPtr x, int cell_ID)
 Quickly test if a point is inside the bounds of a particular cell. Some locators cache cell bounds and this function can make use of fast access to the data.
virtual int IntersectWithLine (IntPtr p1, IntPtr p2, double tol, ref double t, IntPtr x, IntPtr pcoords, ref int subId)
 Return intersection point (if any) of finite line with cells contained in cell locator.
virtual int IntersectWithLine (IntPtr p1, IntPtr p2, double tol, ref double t, IntPtr x, IntPtr pcoords, ref int subId, ref int cellId)
 Return intersection point (if any) AND the cell which was intersected by the finite line.
virtual int IntersectWithLine (IntPtr p1, IntPtr p2, double tol, ref double t, IntPtr x, IntPtr pcoords, ref int subId, ref int cellId, vtkGenericCell cell)
 Return intersection point (if any) AND the cell which was intersected by the finite line. The cell is returned as a cell id and as a generic cell.
virtual int IntersectWithLine (IntPtr p1, IntPtr p2, vtkPoints points, vtkIdList cellIds)
 Take the passed line segment and intersect it with the data set. This method assumes that the data set is a vtkPolyData that describes a closed surface, and the intersection points that are returned in 'points' alternate between entrance points and exit points. The return value of the function is 0 if no intersections were found,.
override int IsA (string type)
 Undocumented Block.
virtual void LazyEvaluationOff ()
 Most Locators build their search structures during BuildLocator but some may delay construction until it is actually needed. If LazyEvaluation is supported, this turns on/off the feature. if not supported, it is ignored.
virtual void LazyEvaluationOn ()
 Most Locators build their search structures during BuildLocator but some may delay construction until it is actually needed. If LazyEvaluation is supported, this turns on/off the feature. if not supported, it is ignored.
new vtkAbstractCellLocator NewInstance ()
 Undocumented Block.
virtual void RetainCellListsOff ()
 Boolean controls whether to maintain list of cells in each node. not applicable to all implementations, but if the locator is being used as a geometry simplification technique, there is no need to keep them.
virtual void RetainCellListsOn ()
 Boolean controls whether to maintain list of cells in each node. not applicable to all implementations, but if the locator is being used as a geometry simplification technique, there is no need to keep them.
virtual void SetCacheCellBounds (int _arg)
 Boolean controls whether the bounds of each cell are computed only once and then saved. Should be 10 to 20% faster if repeatedly calling any of the Intersect/Find routines and the extra memory won't cause disk caching (24 extra bytes per cell are required to save the bounds).
virtual void SetLazyEvaluation (int _arg)
 Most Locators build their search structures during BuildLocator but some may delay construction until it is actually needed. If LazyEvaluation is supported, this turns on/off the feature. if not supported, it is ignored.
virtual void SetNumberOfCellsPerNode (int _arg)
 Specify the preferred/maximum number of cells in each node/bucket. Default 32. Locators generally operate by subdividing space into smaller regions until the number of cells in each region (or node) reaches the desired level.
virtual void SetRetainCellLists (int _arg)
 Boolean controls whether to maintain list of cells in each node. not applicable to all implementations, but if the locator is being used as a geometry simplification technique, there is no need to keep them.
virtual void SetUseExistingSearchStructure (int _arg)
 Some locators support querying a new dataset without rebuilding the search structure (typically this may occur when a dataset changes due to a time update, but is actually the same topology) Turning on this flag enables some locators to skip the rebuilding phase.
virtual void UseExistingSearchStructureOff ()
 Some locators support querying a new dataset without rebuilding the search structure (typically this may occur when a dataset changes due to a time update, but is actually the same topology) Turning on this flag enables some locators to skip the rebuilding phase.
virtual void UseExistingSearchStructureOn ()
 Some locators support querying a new dataset without rebuilding the search structure (typically this may occur when a dataset changes due to a time update, but is actually the same topology) Turning on this flag enables some locators to skip the rebuilding phase.

Static Public Member Functions

static new int IsTypeOf (string type)
 Undocumented Block.
static new vtkAbstractCellLocator SafeDownCast (vtkObjectBase o)
 Undocumented Block.

Public Attributes

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

Static Public Attributes

static new readonly string MRClassNameKey = "22vtkAbstractCellLocator"
 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 void vtkAbstractCellLocator_CacheCellBoundsOff_01 (HandleRef pThis)
static internal void vtkAbstractCellLocator_CacheCellBoundsOn_02 (HandleRef pThis)
static internal int vtkAbstractCellLocator_FindCell_03 (HandleRef pThis, IntPtr x)
static internal int vtkAbstractCellLocator_FindCell_04 (HandleRef pThis, IntPtr x, double tol2, HandleRef GenCell, IntPtr pcoords, IntPtr weights)
static internal void vtkAbstractCellLocator_FindCellsAlongLine_05 (HandleRef pThis, IntPtr p1, IntPtr p2, double tolerance, HandleRef cells)
static internal void vtkAbstractCellLocator_FindCellsWithinBounds_06 (HandleRef pThis, IntPtr bbox, HandleRef cells)
static internal void vtkAbstractCellLocator_FindClosestPoint_07 (HandleRef pThis, IntPtr x, IntPtr closestPoint, ref int cellId, ref int subId, ref double dist2)
static internal void vtkAbstractCellLocator_FindClosestPoint_08 (HandleRef pThis, IntPtr x, IntPtr closestPoint, HandleRef cell, ref int cellId, ref int subId, ref double dist2)
static internal int vtkAbstractCellLocator_FindClosestPointWithinRadius_09 (HandleRef pThis, IntPtr x, double radius, IntPtr closestPoint, ref int cellId, ref int subId, ref double dist2)
static internal int vtkAbstractCellLocator_FindClosestPointWithinRadius_10 (HandleRef pThis, IntPtr x, double radius, IntPtr closestPoint, HandleRef cell, ref int cellId, ref int subId, ref double dist2)
static internal int vtkAbstractCellLocator_FindClosestPointWithinRadius_11 (HandleRef pThis, IntPtr x, double radius, IntPtr closestPoint, HandleRef cell, ref int cellId, ref int subId, ref double dist2, ref int inside)
static internal int vtkAbstractCellLocator_GetCacheCellBounds_12 (HandleRef pThis)
static internal int vtkAbstractCellLocator_GetLazyEvaluation_13 (HandleRef pThis)
static internal int vtkAbstractCellLocator_GetNumberOfCellsPerNode_14 (HandleRef pThis)
static internal int vtkAbstractCellLocator_GetNumberOfCellsPerNodeMaxValue_15 (HandleRef pThis)
static internal int vtkAbstractCellLocator_GetNumberOfCellsPerNodeMinValue_16 (HandleRef pThis)
static internal int vtkAbstractCellLocator_GetRetainCellLists_17 (HandleRef pThis)
static internal int vtkAbstractCellLocator_GetUseExistingSearchStructure_18 (HandleRef pThis)
static internal byte vtkAbstractCellLocator_InsideCellBounds_19 (HandleRef pThis, IntPtr x, int cell_ID)
static internal int vtkAbstractCellLocator_IntersectWithLine_20 (HandleRef pThis, IntPtr p1, IntPtr p2, double tol, ref double t, IntPtr x, IntPtr pcoords, ref int subId)
static internal int vtkAbstractCellLocator_IntersectWithLine_21 (HandleRef pThis, IntPtr p1, IntPtr p2, double tol, ref double t, IntPtr x, IntPtr pcoords, ref int subId, ref int cellId)
static internal int vtkAbstractCellLocator_IntersectWithLine_22 (HandleRef pThis, IntPtr p1, IntPtr p2, double tol, ref double t, IntPtr x, IntPtr pcoords, ref int subId, ref int cellId, HandleRef cell)
static internal int vtkAbstractCellLocator_IntersectWithLine_23 (HandleRef pThis, IntPtr p1, IntPtr p2, HandleRef points, HandleRef cellIds)
static internal int vtkAbstractCellLocator_IsA_24 (HandleRef pThis, string type)
static internal int vtkAbstractCellLocator_IsTypeOf_25 (string type)
static internal void vtkAbstractCellLocator_LazyEvaluationOff_26 (HandleRef pThis)
static internal void vtkAbstractCellLocator_LazyEvaluationOn_27 (HandleRef pThis)
static internal IntPtr vtkAbstractCellLocator_NewInstance_28 (HandleRef pThis, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal void vtkAbstractCellLocator_RetainCellListsOff_29 (HandleRef pThis)
static internal void vtkAbstractCellLocator_RetainCellListsOn_30 (HandleRef pThis)
static internal IntPtr vtkAbstractCellLocator_SafeDownCast_31 (HandleRef o, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal void vtkAbstractCellLocator_SetCacheCellBounds_32 (HandleRef pThis, int _arg)
static internal void vtkAbstractCellLocator_SetLazyEvaluation_33 (HandleRef pThis, int _arg)
static internal void vtkAbstractCellLocator_SetNumberOfCellsPerNode_34 (HandleRef pThis, int _arg)
static internal void vtkAbstractCellLocator_SetRetainCellLists_35 (HandleRef pThis, int _arg)
static internal void vtkAbstractCellLocator_SetUseExistingSearchStructure_36 (HandleRef pThis, int _arg)
static internal void vtkAbstractCellLocator_UseExistingSearchStructureOff_37 (HandleRef pThis)
static internal void vtkAbstractCellLocator_UseExistingSearchStructureOn_38 (HandleRef pThis)

Static Private Member Functions

static vtkAbstractCellLocator ()
 Automatically generated type registration mechanics.

Detailed Description

vtkAbstractCellLocator - an abstract base class for locators which find cells

Description vtkAbstractCellLocator is a spatial search object to quickly locate cells in 3D. vtkAbstractCellLocator supplies a basic interface which concrete subclasses should implement.

Warning When deriving a class from vtkAbstractCellLocator, one should include the 'hidden' member functions by the following construct in the derived class

/// //BTX
///  using vtkAbstractCellLocator::IntersectWithLine;
///  using vtkAbstractCellLocator::FindClosestPoint;
///  using vtkAbstractCellLocator::FindClosestPointWithinRadius;
/// //ETX
/// 

Constructor & Destructor Documentation

Automatically generated type registration mechanics.

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

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


Member Function Documentation

Boolean controls whether the bounds of each cell are computed only once and then saved. Should be 10 to 20% faster if repeatedly calling any of the Intersect/Find routines and the extra memory won't cause disk caching (24 extra bytes per cell are required to save the bounds).

Boolean controls whether the bounds of each cell are computed only once and then saved. Should be 10 to 20% faster if repeatedly calling any of the Intersect/Find routines and the extra memory won't cause disk caching (24 extra bytes per cell are required to save the bounds).

override void Kitware.VTK.vtkAbstractCellLocator.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.vtkModifiedBSPTree, Kitware.VTK.vtkOBBTree, and Kitware.VTK.vtkCellLocator.

virtual int Kitware.VTK.vtkAbstractCellLocator.FindCell ( IntPtr  x) [virtual]

Returns the Id of the cell containing the point, returns -1 if no cell found. This interface uses a tolerance of zero.

Reimplemented in Kitware.VTK.vtkModifiedBSPTree, and Kitware.VTK.vtkCellLocator.

virtual int Kitware.VTK.vtkAbstractCellLocator.FindCell ( IntPtr  x,
double  tol2,
vtkGenericCell  GenCell,
IntPtr  pcoords,
IntPtr  weights 
) [virtual]

Find the cell containing a given point. returns -1 if no cell found the cell parameters are copied into the supplied variables, a cell must be provided to store the information.

Reimplemented in Kitware.VTK.vtkModifiedBSPTree, and Kitware.VTK.vtkCellLocator.

virtual void Kitware.VTK.vtkAbstractCellLocator.FindCellsAlongLine ( IntPtr  p1,
IntPtr  p2,
double  tolerance,
vtkIdList  cells 
) [virtual]

Given a finite line defined by the two points (p1,p2), return the list of unique cell ids in the buckets containing the line. It is possible that an empty cell list is returned. The user must provide the vtkIdList to populate. This method returns data only after the locator has been built.

Reimplemented in Kitware.VTK.vtkCellLocator.

virtual void Kitware.VTK.vtkAbstractCellLocator.FindCellsWithinBounds ( IntPtr  bbox,
vtkIdList  cells 
) [virtual]

Return a list of unique cell ids inside of a given bounding box. The user must provide the vtkIdList to populate. This method returns data only after the locator has been built.

Reimplemented in Kitware.VTK.vtkCellLocator.

virtual void Kitware.VTK.vtkAbstractCellLocator.FindClosestPoint ( IntPtr  x,
IntPtr  closestPoint,
ref int  cellId,
ref int  subId,
ref double  dist2 
) [virtual]

Return the closest point and the cell which is closest to the point x. The closest point is somewhere on a cell, it need not be one of the vertices of the cell.

Reimplemented in Kitware.VTK.vtkCellLocator, and Kitware.VTK.vtkOBBTree.

virtual void Kitware.VTK.vtkAbstractCellLocator.FindClosestPoint ( IntPtr  x,
IntPtr  closestPoint,
vtkGenericCell  cell,
ref int  cellId,
ref int  subId,
ref double  dist2 
) [virtual]

Return the closest point and the cell which is closest to the point x. The closest point is somewhere on a cell, it need not be one of the vertices of the cell. This version takes in a vtkGenericCell to avoid allocating and deallocating the cell. This is much faster than the version which does not take a *cell, especially when this function is called many times in a row such as by a for loop, where the allocation and deallocation can be done only once outside the for loop. If a cell is found, "cell" contains the points and ptIds for the cell "cellId" upon exit.

Reimplemented in Kitware.VTK.vtkCellLocator, and Kitware.VTK.vtkOBBTree.

virtual int Kitware.VTK.vtkAbstractCellLocator.FindClosestPointWithinRadius ( IntPtr  x,
double  radius,
IntPtr  closestPoint,
ref int  cellId,
ref int  subId,
ref double  dist2 
) [virtual]

Return the closest point within a specified radius and the cell which is closest to the point x. The closest point is somewhere on a cell, it need not be one of the vertices of the cell. This method returns 1 if a point is found within the specified radius. If there are no cells within the specified radius, the method returns 0 and the values of closestPoint, cellId, subId, and dist2 are undefined.

Reimplemented in Kitware.VTK.vtkCellLocator, and Kitware.VTK.vtkOBBTree.

virtual int Kitware.VTK.vtkAbstractCellLocator.FindClosestPointWithinRadius ( IntPtr  x,
double  radius,
IntPtr  closestPoint,
vtkGenericCell  cell,
ref int  cellId,
ref int  subId,
ref double  dist2 
) [virtual]

Return the closest point within a specified radius and the cell which is closest to the point x. The closest point is somewhere on a cell, it need not be one of the vertices of the cell. This method returns 1 if a point is found within the specified radius. If there are no cells within the specified radius, the method returns 0 and the values of closestPoint, cellId, subId, and dist2 are undefined. This version takes in a vtkGenericCell to avoid allocating and deallocating the cell. This is much faster than the version which does not take a *cell, especially when this function is called many times in a row such as by a for loop, where the allocation and deallocation can be done only once outside the for loop. If a closest point is found, "cell" contains the points and ptIds for the cell "cellId" upon exit.

Reimplemented in Kitware.VTK.vtkCellLocator, and Kitware.VTK.vtkOBBTree.

virtual int Kitware.VTK.vtkAbstractCellLocator.FindClosestPointWithinRadius ( IntPtr  x,
double  radius,
IntPtr  closestPoint,
vtkGenericCell  cell,
ref int  cellId,
ref int  subId,
ref double  dist2,
ref int  inside 
) [virtual]

Return the closest point within a specified radius and the cell which is closest to the point x. The closest point is somewhere on a cell, it need not be one of the vertices of the cell. This method returns 1 if a point is found within the specified radius. If there are no cells within the specified radius, the method returns 0 and the values of closestPoint, cellId, subId, and dist2 are undefined. This version takes in a vtkGenericCell to avoid allocating and deallocating the cell. This is much faster than the version which does not take a *cell, especially when this function is called many times in a row such as by a for loop, where the allocation and dealloction can be done only once outside the for loop. If a closest point is found, "cell" contains the points and ptIds for the cell "cellId" upon exit. If a closest point is found, inside returns the return value of the EvaluatePosition call to the closest cell; inside(=1) or outside(=0).

Reimplemented in Kitware.VTK.vtkCellLocator, and Kitware.VTK.vtkOBBTree.

Boolean controls whether the bounds of each cell are computed only once and then saved. Should be 10 to 20% faster if repeatedly calling any of the Intersect/Find routines and the extra memory won't cause disk caching (24 extra bytes per cell are required to save the bounds).

Most Locators build their search structures during BuildLocator but some may delay construction until it is actually needed. If LazyEvaluation is supported, this turns on/off the feature. if not supported, it is ignored.

Specify the preferred/maximum number of cells in each node/bucket. Default 32. Locators generally operate by subdividing space into smaller regions until the number of cells in each region (or node) reaches the desired level.

Specify the preferred/maximum number of cells in each node/bucket. Default 32. Locators generally operate by subdividing space into smaller regions until the number of cells in each region (or node) reaches the desired level.

Specify the preferred/maximum number of cells in each node/bucket. Default 32. Locators generally operate by subdividing space into smaller regions until the number of cells in each region (or node) reaches the desired level.

Boolean controls whether to maintain list of cells in each node. not applicable to all implementations, but if the locator is being used as a geometry simplification technique, there is no need to keep them.

Some locators support querying a new dataset without rebuilding the search structure (typically this may occur when a dataset changes due to a time update, but is actually the same topology) Turning on this flag enables some locators to skip the rebuilding phase.

virtual bool Kitware.VTK.vtkAbstractCellLocator.InsideCellBounds ( IntPtr  x,
int  cell_ID 
) [virtual]

Quickly test if a point is inside the bounds of a particular cell. Some locators cache cell bounds and this function can make use of fast access to the data.

Reimplemented in Kitware.VTK.vtkModifiedBSPTree.

virtual int Kitware.VTK.vtkAbstractCellLocator.IntersectWithLine ( IntPtr  p1,
IntPtr  p2,
double  tol,
ref double  t,
IntPtr  x,
IntPtr  pcoords,
ref int  subId 
) [virtual]

Return intersection point (if any) of finite line with cells contained in cell locator.

Reimplemented in Kitware.VTK.vtkCellLocator, Kitware.VTK.vtkModifiedBSPTree, and Kitware.VTK.vtkOBBTree.

virtual int Kitware.VTK.vtkAbstractCellLocator.IntersectWithLine ( IntPtr  p1,
IntPtr  p2,
double  tol,
ref double  t,
IntPtr  x,
IntPtr  pcoords,
ref int  subId,
ref int  cellId 
) [virtual]

Return intersection point (if any) AND the cell which was intersected by the finite line.

Reimplemented in Kitware.VTK.vtkCellLocator, Kitware.VTK.vtkModifiedBSPTree, and Kitware.VTK.vtkOBBTree.

virtual int Kitware.VTK.vtkAbstractCellLocator.IntersectWithLine ( IntPtr  p1,
IntPtr  p2,
double  tol,
ref double  t,
IntPtr  x,
IntPtr  pcoords,
ref int  subId,
ref int  cellId,
vtkGenericCell  cell 
) [virtual]

Return intersection point (if any) AND the cell which was intersected by the finite line. The cell is returned as a cell id and as a generic cell.

Reimplemented in Kitware.VTK.vtkCellLocator, Kitware.VTK.vtkModifiedBSPTree, and Kitware.VTK.vtkOBBTree.

virtual int Kitware.VTK.vtkAbstractCellLocator.IntersectWithLine ( IntPtr  p1,
IntPtr  p2,
vtkPoints  points,
vtkIdList  cellIds 
) [virtual]

Take the passed line segment and intersect it with the data set. This method assumes that the data set is a vtkPolyData that describes a closed surface, and the intersection points that are returned in 'points' alternate between entrance points and exit points. The return value of the function is 0 if no intersections were found,.

-1 if point 'a0' lies inside the closed surface, or +1 if point 'a0' lies outside the closed surface. Either 'points' or 'cellIds' can be set to NULL if you don't want to receive that information. This method is currently only implemented in vtkOBBTree

Reimplemented in Kitware.VTK.vtkCellLocator, Kitware.VTK.vtkModifiedBSPTree, and Kitware.VTK.vtkOBBTree.

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

Undocumented Block.

Reimplemented from Kitware.VTK.vtkLocator.

Reimplemented in Kitware.VTK.vtkCellLocator, Kitware.VTK.vtkModifiedBSPTree, and Kitware.VTK.vtkOBBTree.

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

Undocumented Block.

Reimplemented from Kitware.VTK.vtkLocator.

Reimplemented in Kitware.VTK.vtkCellLocator, Kitware.VTK.vtkModifiedBSPTree, and Kitware.VTK.vtkOBBTree.

Most Locators build their search structures during BuildLocator but some may delay construction until it is actually needed. If LazyEvaluation is supported, this turns on/off the feature. if not supported, it is ignored.

Most Locators build their search structures during BuildLocator but some may delay construction until it is actually needed. If LazyEvaluation is supported, this turns on/off the feature. if not supported, it is ignored.

Undocumented Block.

Reimplemented from Kitware.VTK.vtkLocator.

Reimplemented in Kitware.VTK.vtkCellLocator, Kitware.VTK.vtkModifiedBSPTree, and Kitware.VTK.vtkOBBTree.

Boolean controls whether to maintain list of cells in each node. not applicable to all implementations, but if the locator is being used as a geometry simplification technique, there is no need to keep them.

Boolean controls whether to maintain list of cells in each node. not applicable to all implementations, but if the locator is being used as a geometry simplification technique, there is no need to keep them.

Undocumented Block.

Reimplemented from Kitware.VTK.vtkLocator.

Reimplemented in Kitware.VTK.vtkCellLocator, Kitware.VTK.vtkModifiedBSPTree, and Kitware.VTK.vtkOBBTree.

Here is the call graph for this function:

virtual void Kitware.VTK.vtkAbstractCellLocator.SetCacheCellBounds ( int  _arg) [virtual]

Boolean controls whether the bounds of each cell are computed only once and then saved. Should be 10 to 20% faster if repeatedly calling any of the Intersect/Find routines and the extra memory won't cause disk caching (24 extra bytes per cell are required to save the bounds).

virtual void Kitware.VTK.vtkAbstractCellLocator.SetLazyEvaluation ( int  _arg) [virtual]

Most Locators build their search structures during BuildLocator but some may delay construction until it is actually needed. If LazyEvaluation is supported, this turns on/off the feature. if not supported, it is ignored.

virtual void Kitware.VTK.vtkAbstractCellLocator.SetNumberOfCellsPerNode ( int  _arg) [virtual]

Specify the preferred/maximum number of cells in each node/bucket. Default 32. Locators generally operate by subdividing space into smaller regions until the number of cells in each region (or node) reaches the desired level.

virtual void Kitware.VTK.vtkAbstractCellLocator.SetRetainCellLists ( int  _arg) [virtual]

Boolean controls whether to maintain list of cells in each node. not applicable to all implementations, but if the locator is being used as a geometry simplification technique, there is no need to keep them.

Some locators support querying a new dataset without rebuilding the search structure (typically this may occur when a dataset changes due to a time update, but is actually the same topology) Turning on this flag enables some locators to skip the rebuilding phase.

Some locators support querying a new dataset without rebuilding the search structure (typically this may occur when a dataset changes due to a time update, but is actually the same topology) Turning on this flag enables some locators to skip the rebuilding phase.

Some locators support querying a new dataset without rebuilding the search structure (typically this may occur when a dataset changes due to a time update, but is actually the same topology) Turning on this flag enables some locators to skip the rebuilding phase.

static internal void Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_CacheCellBoundsOff_01 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_CacheCellBoundsOn_02 ( HandleRef  pThis) [private]
static internal int Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_FindCell_03 ( HandleRef  pThis,
IntPtr  x 
) [private]
static internal int Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_FindCell_04 ( HandleRef  pThis,
IntPtr  x,
double  tol2,
HandleRef  GenCell,
IntPtr  pcoords,
IntPtr  weights 
) [private]
static internal void Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_FindCellsAlongLine_05 ( HandleRef  pThis,
IntPtr  p1,
IntPtr  p2,
double  tolerance,
HandleRef  cells 
) [private]
static internal void Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_FindCellsWithinBounds_06 ( HandleRef  pThis,
IntPtr  bbox,
HandleRef  cells 
) [private]
static internal void Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_FindClosestPoint_07 ( HandleRef  pThis,
IntPtr  x,
IntPtr  closestPoint,
ref int  cellId,
ref int  subId,
ref double  dist2 
) [private]
static internal void Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_FindClosestPoint_08 ( HandleRef  pThis,
IntPtr  x,
IntPtr  closestPoint,
HandleRef  cell,
ref int  cellId,
ref int  subId,
ref double  dist2 
) [private]
static internal int Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_FindClosestPointWithinRadius_09 ( HandleRef  pThis,
IntPtr  x,
double  radius,
IntPtr  closestPoint,
ref int  cellId,
ref int  subId,
ref double  dist2 
) [private]
static internal int Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_FindClosestPointWithinRadius_10 ( HandleRef  pThis,
IntPtr  x,
double  radius,
IntPtr  closestPoint,
HandleRef  cell,
ref int  cellId,
ref int  subId,
ref double  dist2 
) [private]
static internal int Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_FindClosestPointWithinRadius_11 ( HandleRef  pThis,
IntPtr  x,
double  radius,
IntPtr  closestPoint,
HandleRef  cell,
ref int  cellId,
ref int  subId,
ref double  dist2,
ref int  inside 
) [private]
static internal int Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_GetCacheCellBounds_12 ( HandleRef  pThis) [private]
static internal int Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_GetLazyEvaluation_13 ( HandleRef  pThis) [private]
static internal int Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_GetRetainCellLists_17 ( HandleRef  pThis) [private]
static internal byte Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_InsideCellBounds_19 ( HandleRef  pThis,
IntPtr  x,
int  cell_ID 
) [private]
static internal int Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_IntersectWithLine_20 ( HandleRef  pThis,
IntPtr  p1,
IntPtr  p2,
double  tol,
ref double  t,
IntPtr  x,
IntPtr  pcoords,
ref int  subId 
) [private]
static internal int Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_IntersectWithLine_21 ( HandleRef  pThis,
IntPtr  p1,
IntPtr  p2,
double  tol,
ref double  t,
IntPtr  x,
IntPtr  pcoords,
ref int  subId,
ref int  cellId 
) [private]
static internal int Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_IntersectWithLine_22 ( HandleRef  pThis,
IntPtr  p1,
IntPtr  p2,
double  tol,
ref double  t,
IntPtr  x,
IntPtr  pcoords,
ref int  subId,
ref int  cellId,
HandleRef  cell 
) [private]
static internal int Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_IntersectWithLine_23 ( HandleRef  pThis,
IntPtr  p1,
IntPtr  p2,
HandleRef  points,
HandleRef  cellIds 
) [private]
static internal int Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_IsA_24 ( HandleRef  pThis,
string  type 
) [private]
static internal int Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_IsTypeOf_25 ( string  type) [private]
static internal void Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_LazyEvaluationOff_26 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_LazyEvaluationOn_27 ( HandleRef  pThis) [private]
static internal IntPtr Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_NewInstance_28 ( HandleRef  pThis,
ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal void Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_RetainCellListsOff_29 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_RetainCellListsOn_30 ( HandleRef  pThis) [private]
static internal IntPtr Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_SafeDownCast_31 ( HandleRef  o,
ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal void Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_SetCacheCellBounds_32 ( HandleRef  pThis,
int  _arg 
) [private]
static internal void Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_SetLazyEvaluation_33 ( HandleRef  pThis,
int  _arg 
) [private]
static internal void Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_SetNumberOfCellsPerNode_34 ( HandleRef  pThis,
int  _arg 
) [private]
static internal void Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_SetRetainCellLists_35 ( HandleRef  pThis,
int  _arg 
) [private]
static internal void Kitware.VTK.vtkAbstractCellLocator.vtkAbstractCellLocator_SetUseExistingSearchStructure_36 ( HandleRef  pThis,
int  _arg 
) [private]

Member Data Documentation

new readonly string Kitware.VTK.vtkAbstractCellLocator.MRClassNameKey = "22vtkAbstractCellLocator" [static]

Automatically generated type registration mechanics.

Reimplemented from Kitware.VTK.vtkLocator.

Reimplemented in Kitware.VTK.vtkModifiedBSPTree, Kitware.VTK.vtkOBBTree, and Kitware.VTK.vtkCellLocator.

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

Automatically generated type registration mechanics.

Reimplemented from Kitware.VTK.vtkLocator.

Reimplemented in Kitware.VTK.vtkModifiedBSPTree, Kitware.VTK.vtkOBBTree, and Kitware.VTK.vtkCellLocator.


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