# 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 vtkKdTree(vtkLocator): """ vtkKdTree - a Kd-tree spatial decomposition of a set of points Superclass: vtkLocator 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. @sa vtkLocator vtkCellLocator vtkPKdTree """ def AddDataSet(self, set): # real signature unknown; restored from __doc__ """ AddDataSet(self, set:vtkDataSet) -> None C++: 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. """ pass def AllGetRegionContainingCell(self): # real signature unknown; restored from __doc__ """ AllGetRegionContainingCell(self) -> Pointer C++: int *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. """ pass def BuildLocator(self): # real signature unknown; restored from __doc__ """ BuildLocator(self) -> None C++: void BuildLocator() override; 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. """ pass def BuildLocatorFromPoints(self, pointset): # real signature unknown; restored from __doc__ """ BuildLocatorFromPoints(self, pointset:vtkPointSet) -> None C++: void BuildLocatorFromPoints(vtkPointSet *pointset) BuildLocatorFromPoints(self, ptArray:vtkPoints) -> None C++: 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. * This method works most efficiently when the point arrays are * float arrays. """ pass def BuildMapForDuplicatePoints(self, tolerance): # real signature unknown; restored from __doc__ """ BuildMapForDuplicatePoints(self, tolerance:float) -> vtkIdTypeArray C++: 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). * "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. """ pass def CopyTree(self, kd): # real signature unknown; restored from __doc__ """ CopyTree(kd:vtkKdNode) -> vtkKdNode C++: static vtkKdNode *CopyTree(vtkKdNode *kd) Create a copy of the binary tree representation of the k-d tree spatial partitioning provided. """ return vtkKdNode def CreateCellLists(self, dataSetIndex, regionReqList, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ CreateCellLists(self, dataSetIndex:int, regionReqList:[int, ...], reqListSize:int) -> None C++: void CreateCellLists(int dataSetIndex, int *regionReqList, int reqListSize) CreateCellLists(self, set:vtkDataSet, regionReqList:[int, ...], reqListSize:int) -> None C++: void CreateCellLists(vtkDataSet *set, int *regionReqList, int reqListSize) CreateCellLists(self, regionReqList:[int, ...], listSize:int) -> None C++: void CreateCellLists(int *regionReqList, int listSize) CreateCellLists(self) -> None C++: 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. * When CreateCellLists is called again, the lists created * on the previous call are deleted. """ pass def DeleteCellLists(self): # real signature unknown; restored from __doc__ """ DeleteCellLists(self) -> None C++: void DeleteCellLists() Free the memory used by the cell lists. """ pass def FindClosestNPoints(self, N, x, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ FindClosestNPoints(self, N:int, x:(float, float, float), result:vtkIdList) -> None C++: void FindClosestNPoints(int N, const double x[3], 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. """ pass def FindClosestPoint(self, x, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ FindClosestPoint(self, x:[float, ...], dist2:float) -> int C++: vtkIdType FindClosestPoint(double *x, double &dist2) FindClosestPoint(self, x:float, y:float, z:float, dist2:float) -> int C++: vtkIdType FindClosestPoint(double x, double y, double z, 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. """ pass def FindClosestPointInRegion(self, regionId, x, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ FindClosestPointInRegion(self, regionId:int, x:[float, ...], dist2:float) -> int C++: vtkIdType FindClosestPointInRegion(int regionId, double *x, double &dist2) FindClosestPointInRegion(self, regionId:int, x:float, y:float, z:float, dist2:float) -> int C++: vtkIdType FindClosestPointInRegion(int regionId, double x, double y, double z, 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. """ pass def FindClosestPointWithinRadius(self, radius, x, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ FindClosestPointWithinRadius(self, radius:float, x:(float, float, float), dist2:float) -> int C++: vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], 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. """ pass def FindPoint(self, x, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ FindPoint(self, x:[float, ...]) -> int C++: vtkIdType FindPoint(double *x) FindPoint(self, x:float, y:float, z:float) -> int C++: vtkIdType 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. """ pass def FindPointsInArea(self, area, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ FindPointsInArea(self, area:[float, ...], ids:vtkIdTypeArray, clearArray:bool=True) -> None C++: void FindPointsInArea(double *area, vtkIdTypeArray *ids, bool clearArray=true) 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. """ pass def FindPointsWithinRadius(self, R, x, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ FindPointsWithinRadius(self, R:float, x:(float, float, float), result:vtkIdList) -> None C++: void FindPointsWithinRadius(double R, const double x[3], 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. """ pass def ForceBuildLocator(self): # real signature unknown; restored from __doc__ """ ForceBuildLocator(self) -> None C++: void ForceBuildLocator() override; Build the locator from the input dataset (even if UseExistingSearchStructure is on). """ pass def FreeSearchStructure(self): # real signature unknown; restored from __doc__ """ FreeSearchStructure(self) -> None C++: void FreeSearchStructure() override; Delete the k-d tree data structure. Also delete any cell lists that were computed with CreateCellLists(). """ pass def GenerateRepresentation(self, level, pd): # real signature unknown; restored from __doc__ """ GenerateRepresentation(self, level:int, pd:vtkPolyData) -> None C++: void GenerateRepresentation(int level, vtkPolyData *pd) override; GenerateRepresentation(self, regionList:[int, ...], len:int, pd:vtkPolyData) -> None C++: void GenerateRepresentation(int *regionList, int len, vtkPolyData *pd) Create a polydata representation of the boundaries of the k-d tree regions. If level equals GetLevel(), the leaf nodes are represented. """ pass def GenerateRepresentationUsingDataBoundsOff(self): # real signature unknown; restored from __doc__ """ GenerateRepresentationUsingDataBoundsOff(self) -> None C++: virtual void GenerateRepresentationUsingDataBoundsOff() """ pass def GenerateRepresentationUsingDataBoundsOn(self): # real signature unknown; restored from __doc__ """ GenerateRepresentationUsingDataBoundsOn(self) -> None C++: 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. """ pass def GetBoundaryCellList(self, regionID): # real signature unknown; restored from __doc__ """ GetBoundaryCellList(self, regionID:int) -> vtkIdList C++: 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. """ pass def GetBounds(self, bounds, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ GetBounds(self, bounds:[float, ...]) -> None C++: void GetBounds(double *bounds) Get the spatial bounds of the entire k-d tree space. Sets bounds array to xmin, xmax, ymin, ymax, zmin, zmax. """ pass def GetCellList(self, regionID): # real signature unknown; restored from __doc__ """ GetCellList(self, regionID:int) -> vtkIdList C++: vtkIdList *GetCellList(int regionID) Get the cell list for a region. This returns a pointer to vtkKdTree's memory, so don't free it. """ pass def GetCellLists(self, regions, set, inRegionCells, onBoundaryCells): # real signature unknown; restored from __doc__ """ GetCellLists(self, regions:vtkIntArray, set:int, inRegionCells:vtkIdList, onBoundaryCells:vtkIdList) -> int C++: vtkIdType GetCellLists(vtkIntArray *regions, int set, vtkIdList *inRegionCells, vtkIdList *onBoundaryCells) GetCellLists(self, regions:vtkIntArray, set:vtkDataSet, inRegionCells:vtkIdList, onBoundaryCells:vtkIdList) -> int C++: vtkIdType GetCellLists(vtkIntArray *regions, vtkDataSet *set, vtkIdList *inRegionCells, vtkIdList *onBoundaryCells) GetCellLists(self, regions:vtkIntArray, inRegionCells:vtkIdList, onBoundaryCells:vtkIdList) -> int C++: vtkIdType 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 nullptr, 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. """ return 0 def GetCuts(self): # real signature unknown; restored from __doc__ """ GetCuts(self) -> vtkBSPCuts C++: virtual vtkBSPCuts *GetCuts() Get a vtkBSPCuts object, a general object representing an axis- aligned spatial partitioning. Used by vtkBSPIntersections. """ return vtkBSPCuts def GetDataSet(self, n): # real signature unknown; restored from __doc__ """ GetDataSet(self, n:int) -> vtkDataSet C++: vtkDataSet *GetDataSet(int n) GetDataSet(self) -> vtkDataSet C++: vtkDataSet *GetDataSet() override; Get the nth defined data set in the spatial partitioning. (If you used SetNthDataSet to define 0,1 and 3 and ask for data set 2, you get 3.) Return the n'th data set. """ return vtkDataSet def GetDataSetIndex(self, set): # real signature unknown; restored from __doc__ """ GetDataSetIndex(self, set:vtkDataSet) -> int C++: int GetDataSetIndex(vtkDataSet *set) Return the index of the given data set. Returns -1 if that data set does not exist. """ return 0 def GetDataSets(self): # real signature unknown; restored from __doc__ """ GetDataSets(self) -> vtkDataSetCollection C++: virtual vtkDataSetCollection *GetDataSets() Return a collection of all the data sets. """ return vtkDataSetCollection def GetFudgeFactor(self): # real signature unknown; restored from __doc__ """ GetFudgeFactor(self) -> float C++: 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 multiplied by 10e-6. """ return 0.0 def GetGenerateRepresentationUsingDataBounds(self): # real signature unknown; restored from __doc__ """ GetGenerateRepresentationUsingDataBounds(self) -> int C++: virtual vtkTypeBool GetGenerateRepresentationUsingDataBounds( ) """ return 0 def GetIncludeRegionBoundaryCells(self): # real signature unknown; restored from __doc__ """ GetIncludeRegionBoundaryCells(self) -> int C++: virtual vtkTypeBool GetIncludeRegionBoundaryCells() """ return 0 def GetMinCells(self): # real signature unknown; restored from __doc__ """ GetMinCells(self) -> int C++: virtual int GetMinCells() """ return 0 def GetNumberOfDataSets(self): # real signature unknown; restored from __doc__ """ GetNumberOfDataSets(self) -> int C++: int GetNumberOfDataSets() Get the number of data sets included in spatial partitioning """ 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 GetNumberOfRegions(self): # real signature unknown; restored from __doc__ """ GetNumberOfRegions(self) -> int C++: virtual int GetNumberOfRegions() The number of leaf nodes of the tree, the spatial regions """ return 0 def GetNumberOfRegionsOrLess(self): # real signature unknown; restored from __doc__ """ GetNumberOfRegionsOrLess(self) -> int C++: 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). """ return 0 def GetNumberOfRegionsOrMore(self): # real signature unknown; restored from __doc__ """ GetNumberOfRegionsOrMore(self) -> int C++: 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). """ return 0 def GetPointsInRegion(self, regionId): # real signature unknown; restored from __doc__ """ GetPointsInRegion(self, regionId:int) -> vtkIdTypeArray C++: 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. """ pass def GetRegionBounds(self, regionID, bounds, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ GetRegionBounds(self, regionID:int, bounds:[float, float, float, float, float, float]) -> None C++: void GetRegionBounds(int regionID, double bounds[6]) Get the spatial bounds of k-d tree region """ pass def GetRegionContainingCell(self, set, cellID): # real signature unknown; restored from __doc__ """ GetRegionContainingCell(self, set:vtkDataSet, cellID:int) -> int C++: int GetRegionContainingCell(vtkDataSet *set, vtkIdType cellID) GetRegionContainingCell(self, set:int, cellID:int) -> int C++: int GetRegionContainingCell(int set, vtkIdType cellID) GetRegionContainingCell(self, cellID:int) -> int C++: int GetRegionContainingCell(vtkIdType 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. """ return 0 def GetRegionContainingPoint(self, x, y, z): # real signature unknown; restored from __doc__ """ GetRegionContainingPoint(self, x:float, y:float, z:float) -> int C++: int GetRegionContainingPoint(double x, double y, double z) Get the id of the region containing the specified location. """ return 0 def GetRegionDataBounds(self, regionID, bounds, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ GetRegionDataBounds(self, regionID:int, bounds:[float, float, float, float, float, float]) -> None C++: void GetRegionDataBounds(int regionID, double bounds[6]) Get the bounds of the data within the k-d tree region """ pass def GetTiming(self): # real signature unknown; restored from __doc__ """ GetTiming(self) -> int C++: virtual vtkTypeBool GetTiming() """ return 0 def IncludeRegionBoundaryCellsOff(self): # real signature unknown; restored from __doc__ """ IncludeRegionBoundaryCellsOff(self) -> None C++: virtual void IncludeRegionBoundaryCellsOff() """ pass def IncludeRegionBoundaryCellsOn(self): # real signature unknown; restored from __doc__ """ IncludeRegionBoundaryCellsOn(self) -> None C++: virtual void IncludeRegionBoundaryCellsOn() """ pass def InvalidateGeometry(self): # real signature unknown; restored from __doc__ """ InvalidateGeometry(self) -> None C++: 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. """ 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 NewGeometry(self): # real signature unknown; restored from __doc__ """ NewGeometry(self) -> int C++: 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. """ return 0 def NewInstance(self): # real signature unknown; restored from __doc__ """ NewInstance(self) -> vtkKdTree C++: vtkKdTree *NewInstance() """ return vtkKdTree def OmitNoPartitioning(self): # real signature unknown; restored from __doc__ """ OmitNoPartitioning(self) -> None C++: void OmitNoPartitioning() Partition along all three axes - this is the default """ pass def OmitXPartitioning(self): # real signature unknown; restored from __doc__ """ OmitXPartitioning(self) -> None C++: void OmitXPartitioning() Omit partitions along the X axis, yielding shafts in the X direction """ pass def OmitXYPartitioning(self): # real signature unknown; restored from __doc__ """ OmitXYPartitioning(self) -> None C++: void OmitXYPartitioning() Omit partitions along the X and Y axes, yielding slabs along Z """ pass def OmitYPartitioning(self): # real signature unknown; restored from __doc__ """ OmitYPartitioning(self) -> None C++: void OmitYPartitioning() Omit partitions along the Y axis, yielding shafts in the Y direction """ pass def OmitYZPartitioning(self): # real signature unknown; restored from __doc__ """ OmitYZPartitioning(self) -> None C++: void OmitYZPartitioning() Omit partitions along the Y and Z axes, yielding slabs along X """ pass def OmitZPartitioning(self): # real signature unknown; restored from __doc__ """ OmitZPartitioning(self) -> None C++: void OmitZPartitioning() Omit partitions along the Z axis, yielding shafts in the Z direction """ pass def OmitZXPartitioning(self): # real signature unknown; restored from __doc__ """ OmitZXPartitioning(self) -> None C++: void OmitZXPartitioning() Omit partitions along the Z and X axes, yielding slabs along Y """ pass def PrintRegion(self, id): # real signature unknown; restored from __doc__ """ PrintRegion(self, id:int) -> None C++: void PrintRegion(int id) Print out leaf node data for given id """ pass def PrintTree(self): # real signature unknown; restored from __doc__ """ PrintTree(self) -> None C++: void PrintTree() Print out nodes of kd tree """ pass def PrintVerboseTree(self): # real signature unknown; restored from __doc__ """ PrintVerboseTree(self) -> None C++: void PrintVerboseTree() """ pass def RemoveAllDataSets(self): # real signature unknown; restored from __doc__ """ RemoveAllDataSets(self) -> None C++: virtual void RemoveAllDataSets() """ pass def RemoveDataSet(self, index): # real signature unknown; restored from __doc__ """ RemoveDataSet(self, index:int) -> None C++: virtual void RemoveDataSet(int index) RemoveDataSet(self, set:vtkDataSet) -> None C++: virtual void RemoveDataSet(vtkDataSet *set) Remove the given data set. """ pass def SafeDownCast(self, o): # real signature unknown; restored from __doc__ """ SafeDownCast(o:vtkObjectBase) -> vtkKdTree C++: static vtkKdTree *SafeDownCast(vtkObjectBase *o) """ return vtkKdTree def SetCuts(self, cuts): # real signature unknown; restored from __doc__ """ SetCuts(self, cuts:vtkBSPCuts) -> None C++: 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. """ pass def SetDataSet(self, set): # real signature unknown; restored from __doc__ """ SetDataSet(self, set:vtkDataSet) -> None C++: void SetDataSet(vtkDataSet *set) override; This class can compute a spatial decomposition based on the cells in a list of one or more input data sets. SetDataSet sets the first data set in the list to the named set. SetNthDataSet sets the data set at index N to the data set named. RemoveData set takes either the data set itself or an index and removes that data set from the list of data sets. AddDataSet adds a data set to the list of data sets. Clear out all data sets and replace with single data set. For backward compatibility with superclass. """ pass def SetFudgeFactor(self, _arg): # real signature unknown; restored from __doc__ """ SetFudgeFactor(self, _arg:float) -> None C++: virtual void SetFudgeFactor(double _arg) """ pass def SetGenerateRepresentationUsingDataBounds(self, _arg): # real signature unknown; restored from __doc__ """ SetGenerateRepresentationUsingDataBounds(self, _arg:int) -> None C++: virtual void SetGenerateRepresentationUsingDataBounds( vtkTypeBool _arg) """ pass def SetIncludeRegionBoundaryCells(self, _arg): # real signature unknown; restored from __doc__ """ SetIncludeRegionBoundaryCells(self, _arg:int) -> None C++: virtual void SetIncludeRegionBoundaryCells(vtkTypeBool _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. """ pass def SetMinCells(self, _arg): # real signature unknown; restored from __doc__ """ SetMinCells(self, _arg:int) -> None C++: virtual void SetMinCells(int _arg) Minimum number of cells per spatial region. Default is 100. """ pass def SetNewBounds(self, bounds, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ SetNewBounds(self, bounds:[float, ...]) -> None C++: void SetNewBounds(double *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. """ pass def SetNumberOfRegionsOrLess(self, _arg): # real signature unknown; restored from __doc__ """ SetNumberOfRegionsOrLess(self, _arg:int) -> None C++: virtual void SetNumberOfRegionsOrLess(int _arg) """ pass def SetNumberOfRegionsOrMore(self, _arg): # real signature unknown; restored from __doc__ """ SetNumberOfRegionsOrMore(self, _arg:int) -> None C++: virtual void SetNumberOfRegionsOrMore(int _arg) """ pass def SetTiming(self, _arg): # real signature unknown; restored from __doc__ """ SetTiming(self, _arg:int) -> None C++: virtual void SetTiming(vtkTypeBool _arg) """ pass def TimingOff(self): # real signature unknown; restored from __doc__ """ TimingOff(self) -> None C++: virtual void TimingOff() """ pass def TimingOn(self): # real signature unknown; restored from __doc__ """ TimingOn(self) -> None C++: virtual void TimingOn() Turn on timing of the k-d tree build """ pass def ViewOrderAllRegionsFromPosition(self, directionOfProjection, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ ViewOrderAllRegionsFromPosition(self, directionOfProjection:( float, float, float), orderedList:vtkIntArray) -> int C++: int ViewOrderAllRegionsFromPosition( const double directionOfProjection[3], 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. """ pass def ViewOrderAllRegionsInDirection(self, directionOfProjection, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ ViewOrderAllRegionsInDirection(self, directionOfProjection:(float, float, float), orderedList:vtkIntArray) -> int C++: int ViewOrderAllRegionsInDirection( const double directionOfProjection[3], 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. """ pass def ViewOrderRegionsFromPosition(self, regionIds, directionOfProjection, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ ViewOrderRegionsFromPosition(self, regionIds:vtkIntArray, directionOfProjection:(float, float, float), orderedList:vtkIntArray) -> int C++: int ViewOrderRegionsFromPosition(vtkIntArray *regionIds, const double directionOfProjection[3], 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. """ pass def ViewOrderRegionsInDirection(self, regionIds, directionOfProjection, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ ViewOrderRegionsInDirection(self, regionIds:vtkIntArray, directionOfProjection:(float, float, float), orderedList:vtkIntArray) -> int C++: int ViewOrderRegionsInDirection(vtkIntArray *regionIds, const double directionOfProjection[3], 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. """ 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__': 'vtkKdTree', 'IsTypeOf': , 'IsA': , 'SafeDownCast': , 'NewInstance': , 'GetNumberOfGenerationsFromBaseType': , 'GetNumberOfGenerationsFromBase': , 'TimingOn': , 'TimingOff': , 'SetTiming': , 'GetTiming': , 'SetMinCells': , 'GetMinCells': , 'GetNumberOfRegionsOrLess': , 'SetNumberOfRegionsOrLess': , 'GetNumberOfRegionsOrMore': , 'SetNumberOfRegionsOrMore': , 'GetFudgeFactor': , 'SetFudgeFactor': , 'GetCuts': , 'SetCuts': , 'OmitXPartitioning': , 'OmitYPartitioning': , 'OmitZPartitioning': , 'OmitXYPartitioning': , 'OmitYZPartitioning': , 'OmitZXPartitioning': , 'OmitNoPartitioning': , 'SetDataSet': , 'AddDataSet': , 'RemoveDataSet': , 'RemoveAllDataSets': , 'GetNumberOfDataSets': , 'GetDataSet': , 'GetDataSets': , 'GetDataSetIndex': , 'GetBounds': , 'SetNewBounds': , 'GetNumberOfRegions': , 'GetRegionBounds': , 'GetRegionDataBounds': , 'PrintTree': , 'PrintVerboseTree': , 'PrintRegion': , 'CreateCellLists': , 'SetIncludeRegionBoundaryCells': , 'GetIncludeRegionBoundaryCells': , 'IncludeRegionBoundaryCellsOn': , 'IncludeRegionBoundaryCellsOff': , 'DeleteCellLists': , 'GetCellList': , 'GetBoundaryCellList': , 'GetCellLists': , 'GetRegionContainingCell': , 'AllGetRegionContainingCell': , 'GetRegionContainingPoint': , 'BuildLocator': , 'ForceBuildLocator': , 'ViewOrderAllRegionsInDirection': , 'ViewOrderRegionsInDirection': , 'ViewOrderAllRegionsFromPosition': , 'ViewOrderRegionsFromPosition': , 'BuildLocatorFromPoints': , 'BuildMapForDuplicatePoints': , 'FindPoint': , 'FindClosestPoint': , 'FindClosestPointWithinRadius': , 'FindClosestPointInRegion': , 'FindPointsWithinRadius': , 'FindClosestNPoints': , 'GetPointsInRegion': , 'FreeSearchStructure': , 'GenerateRepresentation': , 'GenerateRepresentationUsingDataBoundsOn': , 'GenerateRepresentationUsingDataBoundsOff': , 'SetGenerateRepresentationUsingDataBounds': , 'GetGenerateRepresentationUsingDataBounds': , 'NewGeometry': , 'InvalidateGeometry': , 'CopyTree': , 'FindPointsInArea': , '__new__': , '__repr__': , '__str__': , '__getattribute__': , '__setattr__': , '__delattr__': , '__dict__': , '__this__': , '__doc__': 'vtkKdTree - a Kd-tree spatial decomposition of a set of points\\n\\nSuperclass: vtkLocator\\n\\nGiven one or more vtkDataSets, create a load balancing\\n k-d tree decomposition of the points at the center of the cells.\\n Or, create a k-d tree point locator from a list of points.\\n\\n\\n This class can also generate a PolyData representation of\\n the boundaries of the spatial regions in the decomposition.\\n\\n\\n It can sort the regions with respect to a viewing direction,\\n and it can decompose a list of regions into subsets, each\\n of which represent a convex spatial region (since many algorithms\\n require a convex region).\\n\\n\\n If the points were derived from cells, vtkKdTree\\n can create a list of cell Ids for each region for each data set.\\n Two lists are available - all cells with centroid in the region,\\n and all cells that intersect the region but whose centroid lies\\n in another region.\\n\\n\\n For the purpose of removing duplicate points quickly from large\\n data sets, or for finding nearby points, we added another mode\\nfor\\n building the locator. BuildLocatorFromPoints will build a k-d\\ntree\\n from one or more vtkPoints objects. This can be followed by\\n BuildMapForDuplicatePoints which returns a mapping from the\\noriginal\\n ids to a subset of the ids that is unique within a supplied\\n tolerance, or you can use FindPoint and FindClosestPoint to\\n locate points in the original set that the tree was built from.\\n\\n@sa\\n vtkLocator vtkCellLocator vtkPKdTree\\n\\n'})" __vtkname__ = 'vtkKdTree'