# encoding: utf-8
# module vtkmodules.vtkCommonDataModel
# from C:\Users\xukai\Downloads\发票2\venv\Lib\site-packages\vtkmodules\vtkCommonDataModel.cp311-win_amd64.pyd
# by generator 1.147
# no doc

# imports
import vtkmodules.vtkCommonCore as __vtkmodules_vtkCommonCore
import vtkmodules.vtkCommonMath as __vtkmodules_vtkCommonMath
import vtkmodules.vtkCommonTransforms as __vtkmodules_vtkCommonTransforms


from .vtkLocator import vtkLocator

class vtkAbstractCellLocator(vtkLocator):
    """
    vtkAbstractCellLocator - an abstract base class for locators which
    find cells
    
    Superclass: vtkLocator
    
    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
      using vtkAbstractCellLocator::IntersectWithLine;
      using vtkAbstractCellLocator::FindClosestPoint;
      using vtkAbstractCellLocator::FindClosestPointWithinRadius;
      using vtkAbstractCellLocator::FindCell;
     
    
    @sa
    vtkLocator vtkCellLocator vtkStaticCellLocator vtkCellTreeLocator
    vtkModifiedBSPTree vtkOBBTree
    """
    def CacheCellBoundsOff(self): # real signature unknown; restored from __doc__
        """
        CacheCellBoundsOff(self) -> None
        C++: virtual void CacheCellBoundsOff()
        """
        pass

    def CacheCellBoundsOn(self): # real signature unknown; restored from __doc__
        """
        CacheCellBoundsOn(self) -> None
        C++: virtual void CacheCellBoundsOn()
        """
        pass

    def ComputeCellBounds(self): # real signature unknown; restored from __doc__
        """
        ComputeCellBounds(self) -> None
        C++: void ComputeCellBounds()
        
        This function can be used either internally or externally to
        compute only the cached cell bounds if CacheCellBounds is on.
        """
        pass

    def FindCell(self, x, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ 
        """
        FindCell(self, x:[float, float, float]) -> int
        C++: virtual vtkIdType FindCell(double x[3])
        FindCell(self, x:[float, float, float], tol2:float,
            GenCell:vtkGenericCell, pcoords:[float, float, float],
            weights:[float, ...]) -> int
        C++: virtual vtkIdType FindCell(double x[3], double tol2,
            vtkGenericCell *GenCell, double pcoords[3], double *weights)
        FindCell(self, x:[float, float, float], tol2:float,
            GenCell:vtkGenericCell, subId:int, pcoords:[float, float,
            float], weights:[float, ...]) -> int
        C++: virtual vtkIdType FindCell(double x[3], double tol2,
            vtkGenericCell *GenCell, int &subId, double pcoords[3],
            double *weights)
        
        Returns the Id of the cell containing the point, returns -1 if no
        cell found. This interface uses a tolerance of zero
        
        THIS FUNCTION IS NOT THREAD SAFE.
        """
        pass

    def FindCellsAlongLine(self, p1, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ 
        """
        FindCellsAlongLine(self, p1:(float, float, float), p2:(float,
            float, float), tolerance:float, cells:vtkIdList) -> None
        C++: virtual void FindCellsAlongLine(const double p1[3],
            const double p2[3], double tolerance, vtkIdList *cells)
        
        Take the passed line segment and intersect it with the data set.
        For each intersection with the bounds of a cell, the cellIds have
        the relevant information added sort by t. If cellIds is nullptr
        pointer, then no information is generated for that list.
        
        A vtkAbstractCellLocator subclass needs to implement
        IntersectWithLine that takes cells ids, which is used internally
        to implement FindCellsAlongLine.
        
        THIS FUNCTION IS THREAD SAFE.
        """
        pass

    def FindCellsAlongPlane(self, o, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ 
        """
        FindCellsAlongPlane(self, o:(float, float, float), n:(float,
            float, float), tolerance:float, cells:vtkIdList) -> None
        C++: virtual void FindCellsAlongPlane(const double o[3],
            const double n[3], double tolerance, vtkIdList *cells)
        
        Given an unbounded plane defined by an origin o[3] and unit
        normal n[3], return the list of unique cell ids in the buckets
        containing the plane. It is possible that an empty cell list is
        returned. The user must provide the vtkIdList cell list to
        populate. This method returns data only after the locator has
        been built.
        
        THIS FUNCTION IS THREAD SAFE.
        """
        pass

    def FindCellsWithinBounds(self, bbox, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ 
        """
        FindCellsWithinBounds(self, bbox:[float, ...], cells:vtkIdList)
            -> None
        C++: virtual void FindCellsWithinBounds(double *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 FUNCTION IS THREAD SAFE.
        """
        pass

    def FindClosestPoint(self, x, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ 
        """
        FindClosestPoint(self, x:(float, float, float),
            closestPoint:[float, float, float], cellId:int, subId:int,
            dist2:float) -> None
        C++: virtual void FindClosestPoint(const double x[3],
            double closestPoint[3], vtkIdType &cellId, int &subId,
            double &dist2)
        FindClosestPoint(self, x:(float, float, float),
            closestPoint:[float, float, float], cell:vtkGenericCell,
            cellId:int, subId:int, dist2:float) -> None
        C++: virtual void FindClosestPoint(const double x[3],
            double closestPoint[3], vtkGenericCell *cell,
            vtkIdType &cellId, int &subId, 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.
        
        A vtkAbstractCellLocator subclass needs to implement
        FindClosestPointWithinRadius which is used internally to
        implement FindClosestPoint.
        
        THIS FUNCTION IS NOT THREAD SAFE.
        """
        pass

    def FindClosestPointWithinRadius(self, x, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ 
        """
        FindClosestPointWithinRadius(self, x:[float, float, float],
            radius:float, closestPoint:[float, float, float], cellId:int,
            subId:int, dist2:float) -> int
        C++: virtual vtkIdType FindClosestPointWithinRadius(double x[3],
            double radius, double closestPoint[3], vtkIdType &cellId,
            int &subId, double &dist2)
        FindClosestPointWithinRadius(self, x:[float, float, float],
            radius:float, closestPoint:[float, float, float],
            cell:vtkGenericCell, cellId:int, subId:int, dist2:float)
            -> int
        C++: virtual vtkIdType FindClosestPointWithinRadius(double x[3],
            double radius, double closestPoint[3], vtkGenericCell *cell,
            vtkIdType &cellId, int &subId, double &dist2)
        FindClosestPointWithinRadius(self, x:[float, float, float],
            radius:float, closestPoint:[float, float, float],
            cell:vtkGenericCell, cellId:int, subId:int, dist2:float,
            inside:int) -> int
        C++: virtual vtkIdType FindClosestPointWithinRadius(double x[3],
            double radius, double closestPoint[3], vtkGenericCell *cell,
            vtkIdType &cellId, int &subId, double &dist2, 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 FUNCTION IS NOT THREAD SAFE.
        """
        pass

    def GetCacheCellBounds(self): # real signature unknown; restored from __doc__
        """
        GetCacheCellBounds(self) -> int
        C++: virtual vtkTypeBool GetCacheCellBounds()
        """
        return 0

    def GetLazyEvaluation(self): # real signature unknown; restored from __doc__
        """
        GetLazyEvaluation(self) -> int
        C++: virtual vtkTypeBool GetLazyEvaluation()
        """
        return 0

    def GetNumberOfCellsPerNode(self): # real signature unknown; restored from __doc__
        """
        GetNumberOfCellsPerNode(self) -> int
        C++: virtual int GetNumberOfCellsPerNode()
        """
        return 0

    def GetNumberOfCellsPerNodeMaxValue(self): # real signature unknown; restored from __doc__
        """
        GetNumberOfCellsPerNodeMaxValue(self) -> int
        C++: virtual int GetNumberOfCellsPerNodeMaxValue()
        """
        return 0

    def GetNumberOfCellsPerNodeMinValue(self): # real signature unknown; restored from __doc__
        """
        GetNumberOfCellsPerNodeMinValue(self) -> int
        C++: virtual int GetNumberOfCellsPerNodeMinValue()
        """
        return 0

    def GetNumberOfGenerationsFromBase(self, type): # real signature unknown; restored from __doc__
        """
        GetNumberOfGenerationsFromBase(self, type:str) -> int
        C++: vtkIdType GetNumberOfGenerationsFromBase(const char *type)
            override;
        
        Given the name of a base class of this class type, return the
        distance of inheritance between this class type and the named
        class (how many generations of inheritance are there between this
        class and the named class). If the named class is not in this
        class's inheritance tree, return a negative value. Valid
        responses will always be nonnegative. This method works in
        combination with vtkTypeMacro found in vtkSetGet.h.
        """
        return 0

    def GetNumberOfGenerationsFromBaseType(self, type): # real signature unknown; restored from __doc__
        """
        GetNumberOfGenerationsFromBaseType(type:str) -> int
        C++: static vtkIdType GetNumberOfGenerationsFromBaseType(
            const char *type)
        
        Given a the name of a base class of this class type, return the
        distance of inheritance between this class type and the named
        class (how many generations of inheritance are there between this
        class and the named class). If the named class is not in this
        class's inheritance tree, return a negative value. Valid
        responses will always be nonnegative. This method works in
        combination with vtkTypeMacro found in vtkSetGet.h.
        """
        return 0

    def GetRetainCellLists(self): # real signature unknown; restored from __doc__
        """
        GetRetainCellLists(self) -> int
        C++: virtual vtkTypeBool GetRetainCellLists()
        """
        return 0

    def InsideCellBounds(self, x, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ 
        """
        InsideCellBounds(self, x:[float, float, float], cell_ID:int)
            -> bool
        C++: virtual bool InsideCellBounds(double x[3], vtkIdType 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. This function should be used ONLY
        after the locator is built.
        """
        pass

    def IntersectWithLine(self, p1, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ 
        """
        IntersectWithLine(self, p1:(float, float, float), p2:(float,
            float, float), tol:float, t:float, x:[float, float, float],
            pcoords:[float, float, float], subId:int) -> int
        C++: virtual int IntersectWithLine(const double p1[3],
            const double p2[3], double tol, double &t, double x[3],
            double pcoords[3], int &subId)
        IntersectWithLine(self, p1:(float, float, float), p2:(float,
            float, float), tol:float, t:float, x:[float, float, float],
            pcoords:[float, float, float], subId:int, cellId:int) -> int
        C++: virtual int IntersectWithLine(const double p1[3],
            const double p2[3], double tol, double &t, double x[3],
            double pcoords[3], int &subId, vtkIdType &cellId)
        IntersectWithLine(self, p1:(float, float, float), p2:(float,
            float, float), tol:float, t:float, x:[float, float, float],
            pcoords:[float, float, float], subId:int, cellId:int,
            cell:vtkGenericCell) -> int
        C++: virtual int IntersectWithLine(const double p1[3],
            const double p2[3], double tol, double &t, double x[3],
            double pcoords[3], int &subId, vtkIdType &cellId,
            vtkGenericCell *cell)
        IntersectWithLine(self, p1:(float, float, float), p2:(float,
            float, float), points:vtkPoints, cellIds:vtkIdList) -> int
        C++: virtual int IntersectWithLine(const double p1[3],
            const double p2[3], vtkPoints *points, vtkIdList *cellIds)
        IntersectWithLine(self, p1:(float, float, float), p2:(float,
            float, float), tol:float, points:vtkPoints, cellIds:vtkIdList)
             -> int
        C++: virtual int IntersectWithLine(const double p1[3],
            const double p2[3], const double tol, vtkPoints *points,
            vtkIdList *cellIds)
        IntersectWithLine(self, p1:(float, float, float), p2:(float,
            float, float), tol:float, points:vtkPoints, cellIds:vtkIdList,
             cell:vtkGenericCell) -> int
        C++: virtual int IntersectWithLine(const double p1[3],
            const double p2[3], const double tol, vtkPoints *points,
            vtkIdList *cellIds, vtkGenericCell *cell)
        
        Return intersection point (if any) of finit ...
         [Truncated]
        """
        pass

    def IsA(self, type): # real signature unknown; restored from __doc__
        """
        IsA(self, type:str) -> int
        C++: vtkTypeBool IsA(const char *type) override;
        
        Return 1 if this class is the same type of (or a subclass of) the
        named class. Returns 0 otherwise. This method works in
        combination with vtkTypeMacro found in vtkSetGet.h.
        """
        return 0

    def IsTypeOf(self, type): # real signature unknown; restored from __doc__
        """
        IsTypeOf(type:str) -> int
        C++: static vtkTypeBool IsTypeOf(const char *type)
        
        Return 1 if this class type is the same type of (or a subclass
        of) the named class. Returns 0 otherwise. This method works in
        combination with vtkTypeMacro found in vtkSetGet.h.
        """
        return 0

    def LazyEvaluationOff(self): # real signature unknown; restored from __doc__
        """
        LazyEvaluationOff(self) -> None
        C++: virtual void LazyEvaluationOff()
        """
        pass

    def LazyEvaluationOn(self): # real signature unknown; restored from __doc__
        """
        LazyEvaluationOn(self) -> None
        C++: virtual void LazyEvaluationOn()
        """
        pass

    def NewInstance(self): # real signature unknown; restored from __doc__
        """
        NewInstance(self) -> vtkAbstractCellLocator
        C++: vtkAbstractCellLocator *NewInstance()
        """
        return vtkAbstractCellLocator

    def RetainCellListsOff(self): # real signature unknown; restored from __doc__
        """
        RetainCellListsOff(self) -> None
        C++: virtual void RetainCellListsOff()
        """
        pass

    def RetainCellListsOn(self): # real signature unknown; restored from __doc__
        """
        RetainCellListsOn(self) -> None
        C++: virtual void RetainCellListsOn()
        """
        pass

    def SafeDownCast(self, o): # real signature unknown; restored from __doc__
        """
        SafeDownCast(o:vtkObjectBase) -> vtkAbstractCellLocator
        C++: static vtkAbstractCellLocator *SafeDownCast(vtkObjectBase *o)
        """
        return vtkAbstractCellLocator

    def SetCacheCellBounds(self, _arg): # real signature unknown; restored from __doc__
        """
        SetCacheCellBounds(self, _arg:int) -> None
        C++: virtual void SetCacheCellBounds(vtkTypeBool _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 (48 extra bytes per cell
        are required to save the bounds).
        """
        pass

    def SetLazyEvaluation(self, __a): # real signature unknown; restored from __doc__
        """
        SetLazyEvaluation(self, __a:int) -> None
        C++: virtual void SetLazyEvaluation(vtkTypeBool)
        
        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.
        """
        pass

    def SetNumberOfCellsPerNode(self, _arg): # real signature unknown; restored from __doc__
        """
        SetNumberOfCellsPerNode(self, _arg:int) -> None
        C++: 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.
        """
        pass

    def SetRetainCellLists(self, _arg): # real signature unknown; restored from __doc__
        """
        SetRetainCellLists(self, _arg:int) -> None
        C++: virtual void SetRetainCellLists(vtkTypeBool _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.
        """
        pass

    def ShallowCopy(self, __a): # real signature unknown; restored from __doc__
        """
        ShallowCopy(self, __a:vtkAbstractCellLocator) -> None
        C++: virtual void ShallowCopy(vtkAbstractCellLocator *)
        
        Shallow copy of a vtkAbstractCellLocator.
        """
        pass

    def __delattr__(self, *args, **kwargs): # real signature unknown
        """ Implement delattr(self, name). """
        pass

    def __getattribute__(self, *args, **kwargs): # real signature unknown
        """ Return getattr(self, name). """
        pass

    def __init__(self, *args, **kwargs): # real signature unknown
        pass

    @staticmethod # known case of __new__
    def __new__(*args, **kwargs): # real signature unknown
        """ Create and return a new object.  See help(type) for accurate signature. """
        pass

    def __repr__(self, *args, **kwargs): # real signature unknown
        """ Return repr(self). """
        pass

    def __setattr__(self, *args, **kwargs): # real signature unknown
        """ Implement setattr(self, name, value). """
        pass

    def __str__(self, *args, **kwargs): # real signature unknown
        """ Return str(self). """
        pass

    __this__ = property(lambda self: object(), lambda self, v: None, lambda self: None)  # default
    """Pointer to the C++ object."""


    __dict__ = None # (!) real value is 'mappingproxy({\'__vtkname__\': \'vtkAbstractCellLocator\', \'IsTypeOf\': <method \'IsTypeOf\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'IsA\': <method \'IsA\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'SafeDownCast\': <method \'SafeDownCast\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'NewInstance\': <method \'NewInstance\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'GetNumberOfGenerationsFromBaseType\': <method \'GetNumberOfGenerationsFromBaseType\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'GetNumberOfGenerationsFromBase\': <method \'GetNumberOfGenerationsFromBase\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'SetNumberOfCellsPerNode\': <method \'SetNumberOfCellsPerNode\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'GetNumberOfCellsPerNodeMinValue\': <method \'GetNumberOfCellsPerNodeMinValue\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'GetNumberOfCellsPerNodeMaxValue\': <method \'GetNumberOfCellsPerNodeMaxValue\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'GetNumberOfCellsPerNode\': <method \'GetNumberOfCellsPerNode\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'SetCacheCellBounds\': <method \'SetCacheCellBounds\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'GetCacheCellBounds\': <method \'GetCacheCellBounds\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'CacheCellBoundsOn\': <method \'CacheCellBoundsOn\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'CacheCellBoundsOff\': <method \'CacheCellBoundsOff\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'ComputeCellBounds\': <method \'ComputeCellBounds\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'SetRetainCellLists\': <method \'SetRetainCellLists\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'GetRetainCellLists\': <method \'GetRetainCellLists\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'RetainCellListsOn\': <method \'RetainCellListsOn\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'RetainCellListsOff\': <method \'RetainCellListsOff\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'SetLazyEvaluation\': <method \'SetLazyEvaluation\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'GetLazyEvaluation\': <method \'GetLazyEvaluation\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'LazyEvaluationOn\': <method \'LazyEvaluationOn\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'LazyEvaluationOff\': <method \'LazyEvaluationOff\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'IntersectWithLine\': <method \'IntersectWithLine\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'FindClosestPoint\': <method \'FindClosestPoint\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'FindClosestPointWithinRadius\': <method \'FindClosestPointWithinRadius\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'FindCellsWithinBounds\': <method \'FindCellsWithinBounds\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'FindCellsAlongLine\': <method \'FindCellsAlongLine\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'FindCellsAlongPlane\': <method \'FindCellsAlongPlane\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'FindCell\': <method \'FindCell\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'InsideCellBounds\': <method \'InsideCellBounds\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'ShallowCopy\': <method \'ShallowCopy\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'__new__\': <built-in method __new__ of type object at 0x00007FF81D60C090>, \'__repr__\': <slot wrapper \'__repr__\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'__str__\': <slot wrapper \'__str__\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'__getattribute__\': <slot wrapper \'__getattribute__\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'__setattr__\': <slot wrapper \'__setattr__\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'__delattr__\': <slot wrapper \'__delattr__\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'__dict__\': <attribute \'__dict__\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'__this__\': <attribute \'__this__\' of \'vtkmodules.vtkCommonDataModel.vtkAbstractCellLocator\' objects>, \'__doc__\': "vtkAbstractCellLocator - an abstract base class for locators which\\nfind cells\\n\\nSuperclass: vtkLocator\\n\\nvtkAbstractCellLocator is a spatial search object to quickly locate\\ncells in 3D. vtkAbstractCellLocator supplies a basic interface which\\nconcrete subclasses should implement.\\n\\n@warning\\nWhen deriving a class from vtkAbstractCellLocator, one should include\\nthe \'hidden\' member functions by the following construct in the\\nderived class\\n  using vtkAbstractCellLocator::IntersectWithLine;\\n  using vtkAbstractCellLocator::FindClosestPoint;\\n  using vtkAbstractCellLocator::FindClosestPointWithinRadius;\\n  using vtkAbstractCellLocator::FindCell;\\n \\n\\n@sa\\nvtkLocator vtkCellLocator vtkStaticCellLocator vtkCellTreeLocator\\nvtkModifiedBSPTree vtkOBBTree\\n\\n"})'
    __vtkname__ = 'vtkAbstractCellLocator'


