ELF> @@<;!"#$%&23UH@dH%(HD$81HHt$HD$HFHD$$D$ t0H|$1HT$8dH+%(uhH@]@HT$H|$H5|$HtHt+HH5HPtHuH1Huff.fUSHHdH%(HD$81HHt$HD$HFHD$$D$ HD$t6H|$1HT$8dH+%(HH[]DHt$H|$tHl$H=HtHH=uHuHc@HH=tHH=tHH=tHff.SH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(u7H0[fDHHuӐHuHcSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uZH0[fDHHuӐtHuHcHHH;tЉff.fSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uZH0[fDHHuӐtHuHcHHH;tЉff.fSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uUH0[fDHHuӐtHuHcfHHH;tЉfSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uUH0[fDHHuӐtHuHcfHHH;tЉfUH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uVH0]fDHHuӐtHHuH뵐HHH;tHH8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(uYH8HHuҐHt!0HuHH@H H;tff.@AUATUHPfnFdH%(HD$H1HHt$HD$HGfnȉD$(fbfD$ uPHo(Ht!D$ +D$$tRH|$1HT$HdH+%(HP]A\A]fDHHufLd$Ht$LtLl$0LLtHT$H5L|$HqD$LHHRHHDff.UH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(H@]fDHHuϐHt$ H|$tD$$t$ t99tHEHHuHH|@HEHH;u;tƉHHff.H8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(H8@HHuҐHtIHH;uQtLJHuHHfHH;t@f.H8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(H8@HHuҐHtIHH;uQtLJHuHHHH;t@1ff.fUH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(H@]fDHHuϐHt$ H|$tD$$t$ tQ9O9L9tHEHHrHHd@HEHH;u49O9L9tHHff.AVAUATUHXfnFdH%(HD$H1HHt$HD$HGfnȉD$(fbfD$ uVHo(Ht!D$ +D$$tPH|$1HT$HdH+%(HX]A\A]A^f.HHuŐLl$0Ld$LLtLt$LLtHt$LtL$LLHHt!HWHHIHT$LAVAUATUHXfnFdH%(HD$H1HHt$HD$HGfnȉD$(fbfD$ uVHo(Ht!D$ +D$$tPH|$1HT$HdH+%(HX]A\A]A^f.HHuŐLd$HLtLl$0LLtLt$LLt$HLLHHtHUHJ@D$LfDATH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$uDH(HtD$9D$tIH11E1HD$(dH+%(H0LA\@HHufHHRxH;IMtoI$H5LPtZHuLIHoHbL1HHP@L8fE1H"DIjfATUSH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uYHD$Ho(Ht!\$ +\$$tJH|$1HT$8dH+%(H@[]A\HHuːHt$H|$tD$$Ld$u`HELH@H;H=tLH=u-HaHcVf.LLH=tLH=tLH=tLHЉfATL%H lHH5LuLHLA\ATIUHHt HH5LHtHmtH]A\HH]A\ATUHHfnFdH%(HD$81HH4$HD$HGfnȉD$fbfD$uKHo(HtD$+D$tEH1HT$8dH+%(}HH]A\DHHuΐLd$ HLtD$u/HEHLHHuHHLHff.AUATUHPfnFdH%(HD$H1HHt$HD$HGfnȉD$(fbfD$ uPHo(Ht!D$ +D$$tRH|$1HT$HdH+%(HP]A\A]fDHHufLd$Ht$LtLl$0LLtD$$Ht$u4HELHHhHHZfDLHff.AVAUATUHXfnFdH%(HD$H1HHt$HD$HGfnȉD$(fbfD$ uVHo(Ht!D$ +D$$tPH|$1HT$HdH+%(HX]A\A]A^f.HHuŐLl$0Ld$LLtLt$LLtD$$u>HEHLLHt7H]HcR@HLLfDHT$LAT1UHhHNdH%(HD$X1HGAfnH%fnA)fbAtAH5D1HT$hdH+%(9Hp]A\A]A^A_ÐL Ht$LL$L$ T$$T$(HHo(HtD$ +D$$t|H|$1@H Ht$HL$T$(fD$ HLHo(HRD$ +D$$H|$1(Ll$HT$H5L|$ILt$0LLT$$HEHLLHHcLl$Ld$LH5L|$IqL|$0LLTLLAD$$HL$unHEHLL\HHfHH5f.HLLHLLAUATUHPfnFdH%(HD$H1HHt$HD$HGfnȉD$(fbfD$ uPHo(Ht!D$ +D$$tRH|$1HT$HdH+%(HP]A\A]fDHHufLd$Ht$ LtLl$0LLtHT$ H5L|$ HqD$$t$ u3HELHXHGHH9DLHff.AUATUHPfnFdH%(HD$H1HHt$HD$HGfnȉD$(fbfD$ uPHo(Ht!D$ +D$$tRH|$1HT$HdH+%(HP]A\A]fDHHufLd$Ht$LtLl$0LLtHT$H5L|$HqD$$D$u1HELH`HEHH7LHff.AVAUATUHXfnFdH%(HD$H1HHt$HD$HGfnȉD$(fbfD$ uVHo(Ht!D$ +D$$tPH|$1HT$HdH+%(HX]A\A]A^f.HHuŐLd$HLtLl$0LLtLt$LLtD$$$uBHEHLLPHHt:HHH=HLLHDD$Lff.AW1IAVAUATUSHfnFdH%(H$HG~H%fn)fbÃ'wH Ht$0HL$8T$HfD$@HkHl$0Mp(1HH|$p4AHcLd$pEtIcIMmD$@+D$DHH|$p1HHT$xH9HD$HD$H Ht$0HL$8T$HfD$@HHl$0Mp(1HH|$p4AHcLd$pEtIcIMD$@+D$D HH|$p1HT$xH9t H<H51H$dH+%(Hĸ[]A\A]A^A_ÐH Ht$0HL$8T$HfD$@HIh(HtD$@+D$DH|$01}H Ht$0HL$8T$HfD$@H Ih(HCD$@+D$DH|$01LIHPLIHH|$0H|$p4HcH|$p1IL1LIHH|$0H|$p4HcH|$p1I-L1#LIH+Ld$0Ht$L Ht$ LHt$(LL$DT$(L$ D$HEHHB@Ld$pH|$0Lt$DHEHLHHH`HUL|$PHL8DLH"E~ZID$H9HAE;D1Hf.fA$$HH9uDAt AËT$DILLLIE~6Ic1fHH9tAf.ztHHYLH|$pNf.Ht$HHt$ HHt$(HDLHE~PID$H9YAELD1HfA,,HH9uDAt AËD$DT$(L$ D$ILLIE~7Ic1f.HH9tAf.ztHHLH|$pf.HLHsLLL2HHPD1DAHH9uLL.DLHD1f.AHH9uDLHHHfH8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(uLH8HHuҐu$H(HuHH@ff.ATUHHfnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uJHo(Ht!D$ +D$$tDH|$1HT$8dH+%(HH]A\fHHuѐLd$Ht$ LtHT$ H5L|$ HtD$$t$ u0HEH8HuHHgDHATUHHfnFdH%(HD$81HH4$HD$HGfnȉD$fbfD$uKHo(HtD$+D$tEH1HT$8dH+%(}HH]A\DHHuΐLd$ HLtD$u/HEHLHHuHHLHff.AV1IAUATUSHpfnFdH%(HD$hHG~H%fnfb)H Ht$HL$T$(fD$ H%Hl$1Mp(1HH|$04AHcLl$0EM*D$ +D$$uHH|$01HT$8H9txHtsHD$HD$b@H Ht$HL$T$(fD$ HDIx(HtD$$9D$ H|$111H51HT$hdH+%(]Hp[]A\A]A^fIcI\LIHH|$1H|$04HcH|$01IL1fH5HhH;!HH/H HH+DDLHE~YIEH98AD$*D1HfATHH9uDAt ADËD$$ILLpE~3Ic1DHH9tADf.ztHIH|$01MHHHoXHpHHH5HfLIH1DLL/D1ADHH9uDL1H0HH8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(uLH8HHuҐu$H0HuHH@9O9L9tH9tHDHH0HATLgXLpLA\SafeDownCastvtkObjectBaseIsTypeOfGetNumberOfPointsGetMaxPointsPerLeafMaxValueGetMaxPointsPerLeafMinValueGetBuildCubicOctreeGetMaxPointsPerLeafGetLocatorPointsInitializeFindPointsWithinSquaredRadiusvtkIdListSetBuildCubicOctreeBuildCubicOctreeOnBuildCubicOctreeOffSetMaxPointsPerLeafInsertPointWithoutCheckingNewInstanceIsAInsertNextPointInsertPointInsertUniquePointIsInsertedPointInitPointInsertionvtkPointsFindClosestNPointsFindPointsWithinRadiusFindClosestPointWithinRadiusFindClosestPointBuildLocatorGenerateRepresentationvtkPolyDataFindClosestInsertedPointGetBoundsp_voidFreeSearchStructurevtkIncrementalOctreePointLocatorFindClosestPointWithinSquaredRadiusvtkIncrementalOctreePointLocator - Incremental octree in support of both point location and point insertion. Superclass: vtkIncrementalPointLocator As opposed to the uniform bin-based search structure (adopted in class vtkPointLocator) with a fixed spatial resolution, an octree mechanism employs a hierarchy of tree-like sub-division of the 3D data domain. Thus it enables data-aware multi-resolution and accordingly accelerated point location as well as insertion, particularly when handling a radically imbalanced layout of points as not uncommon in datasets defined on adaptive meshes. Compared to a static point locator supporting pure location functionalities through some search structure established from a fixed set of points, an incremental point locator allows for, in addition, point insertion capabilities, with the search structure maintaining a dynamically increasing number of points. Class vtkIncrementalOctreePointLocator is an octree-based accelerated implementation of the functionalities of the uniform bin-based incremental point locator vtkPointLocator. For point location, an octree is built by accessing a vtkDataSet, specifically a vtkPointSet. For point insertion, an empty octree is inited and then incrementally populated as points are inserted. Three increasingly complex point insertion modes, i.e., direct check-free insertion, zero tolerance insertion, and non-zero tolerance insertion, are supported. In fact, the octree used in the point location mode is actually constructed via direct check-free point insertion. This class also provides a polygonal representation of the octree boundary. @sa vtkAbstractPointLocator, vtkIncrementalPointLocator, vtkPointLocator, vtkMergePoints vtkCommonDataModelPython.vtkIncrementalOctreePointLocatorV.IsTypeOf(string) -> int C++: static vtkTypeBool IsTypeOf(const char *type) Standard type and print methods. V.IsA(string) -> int C++: vtkTypeBool IsA(const char *type) override; Standard type and print methods. V.SafeDownCast(vtkObjectBase) -> vtkIncrementalOctreePointLocator C++: static vtkIncrementalOctreePointLocator *SafeDownCast( vtkObjectBase *o) Standard type and print methods. V.NewInstance() -> vtkIncrementalOctreePointLocator C++: vtkIncrementalOctreePointLocator *NewInstance() Standard type and print methods. V.SetMaxPointsPerLeaf(int) C++: virtual void SetMaxPointsPerLeaf(int _arg) Set/Get the maximum number of points that a leaf node may maintain. Note that the actual number of points maintained by a leaf node might exceed this threshold if there is a large number (equal to or greater than the threshold) of exactly duplicate points (with zero distance) to be inserted (e.g., to construct an octree for subsequent point location) in extreme cases. Respecting this threshold in such scenarios would cause endless node sub-division. Thus this threshold is broken, but only in case of such situations. V.GetMaxPointsPerLeafMinValue() -> int C++: virtual int GetMaxPointsPerLeafMinValue() Set/Get the maximum number of points that a leaf node may maintain. Note that the actual number of points maintained by a leaf node might exceed this threshold if there is a large number (equal to or greater than the threshold) of exactly duplicate points (with zero distance) to be inserted (e.g., to construct an octree for subsequent point location) in extreme cases. Respecting this threshold in such scenarios would cause endless node sub-division. Thus this threshold is broken, but only in case of such situations. V.GetMaxPointsPerLeafMaxValue() -> int C++: virtual int GetMaxPointsPerLeafMaxValue() Set/Get the maximum number of points that a leaf node may maintain. Note that the actual number of points maintained by a leaf node might exceed this threshold if there is a large number (equal to or greater than the threshold) of exactly duplicate points (with zero distance) to be inserted (e.g., to construct an octree for subsequent point location) in extreme cases. Respecting this threshold in such scenarios would cause endless node sub-division. Thus this threshold is broken, but only in case of such situations. V.GetMaxPointsPerLeaf() -> int C++: virtual int GetMaxPointsPerLeaf() Set/Get the maximum number of points that a leaf node may maintain. Note that the actual number of points maintained by a leaf node might exceed this threshold if there is a large number (equal to or greater than the threshold) of exactly duplicate points (with zero distance) to be inserted (e.g., to construct an octree for subsequent point location) in extreme cases. Respecting this threshold in such scenarios would cause endless node sub-division. Thus this threshold is broken, but only in case of such situations. V.SetBuildCubicOctree(int) C++: virtual void SetBuildCubicOctree(int _arg) Set/Get whether the search octree is built as a cubic shape or not. V.GetBuildCubicOctree() -> int C++: virtual int GetBuildCubicOctree() Set/Get whether the search octree is built as a cubic shape or not. V.BuildCubicOctreeOn() C++: virtual void BuildCubicOctreeOn() Set/Get whether the search octree is built as a cubic shape or not. V.BuildCubicOctreeOff() C++: virtual void BuildCubicOctreeOff() Set/Get whether the search octree is built as a cubic shape or not. V.GetLocatorPoints() -> vtkPoints C++: virtual vtkPoints *GetLocatorPoints() Get access to the vtkPoints object in which point coordinates are stored for either point location or point insertion. V.Initialize() C++: void Initialize() override; Delete the octree search structure. V.FreeSearchStructure() C++: void FreeSearchStructure() override; Delete the octree search structure. V.GetBounds([float, ...]) C++: void GetBounds(double *bounds) override; V.GetBounds() -> (float, ...) C++: double *GetBounds() override; Get the spatial bounding box of the octree. V.GetNumberOfPoints() -> int C++: int GetNumberOfPoints() Get the number of points maintained by the octree. V.FindClosestInsertedPoint((float, float, float)) -> int C++: vtkIdType FindClosestInsertedPoint(const double x[3]) override; Given a point x assumed to be covered by the octree, return the index of the closest in-octree point regardless of the associated minimum squared distance relative to the squared insertion-tolerance distance. This method is used when performing incremental point insertion. Note -1 indicates that no point is found. InitPointInsertion() should have been called in advance. V.GenerateRepresentation(int, vtkPolyData) C++: void GenerateRepresentation(int nodeLevel, vtkPolyData *polysData) override; Create a polygonal representation of the octree boundary (from the root node to a specified level). V.BuildLocator() C++: void BuildLocator() override; Load points from a dataset to construct an octree for point location. This function resorts to InitPointInsertion() to fulfill some of the work. V.FindClosestPoint((float, float, float)) -> int C++: vtkIdType FindClosestPoint(const double x[3]) override; V.FindClosestPoint(float, float, float) -> int C++: virtual vtkIdType FindClosestPoint(double x, double y, double z) V.FindClosestPoint((float, float, float), [float, ...]) -> int C++: virtual vtkIdType FindClosestPoint(const double x[3], double *miniDist2) V.FindClosestPoint(float, float, float, [float, ...]) -> int C++: virtual vtkIdType FindClosestPoint(double x, double y, double z, double *miniDist2) Given a point x, return the id of the closest point. BuildLocator() should have been called prior to this function. This method is thread safe if BuildLocator() is directly or indirectly called from a single thread first. V.FindClosestPointWithinRadius(float, (float, float, float), float) -> int C++: vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double &dist2) override; Given a point x and a radius, return the id of the closest point within the radius and the associated minimum squared distance (via dist2, this returned distance is valid only if the point id is not -1). Note that BuildLocator() should have been called prior to this function. This method is thread safe if BuildLocator() is directly or indirectly called from a single thread first. V.FindClosestPointWithinSquaredRadius(float, (float, float, float) , float) -> int C++: vtkIdType FindClosestPointWithinSquaredRadius(double radius2, const double x[3], double &dist2) Given a point x and a squared radius radius2, return the id of the closest point within the radius and the associated minimum squared distance (via dist2, note this returned distance is valid only if the point id is not -1). BuildLocator() should have been called prior to this function.This method is thread safe if BuildLocator() is directly or indirectly called from a single thread first. V.FindPointsWithinRadius(float, (float, float, float), vtkIdList) C++: void FindPointsWithinRadius(double R, const double x[3], vtkIdList *result) override; Find all points within a radius R relative to a given point x. The returned point ids (stored in result) are not sorted in any way. BuildLocator() should have been called prior to this function. This method is thread safe if BuildLocator() is directly or indirectly called from a single thread first. V.FindPointsWithinSquaredRadius(float, (float, float, float), vtkIdList) C++: void FindPointsWithinSquaredRadius(double R2, const double x[3], vtkIdList *result) Find all points within a squared radius R2 relative to a given point x. The returned point ids (stored in result) are not sorted in any way. BuildLocator() should have been called prior to this function. This method is thread safe if BuildLocator() is directly or indirectly called from a single thread first. V.FindClosestNPoints(int, (float, float, float), vtkIdList) C++: void FindClosestNPoints(int N, const double x[3], vtkIdList *result) override; Find the closest N points to a given point. The returned point ids (via result) are sorted from closest to farthest. BuildLocator() should have been called prior to this function. This method is thread safe if BuildLocator() is directly or indirectly called from a single thread first. V.InitPointInsertion(vtkPoints, (float, float, float, float, float, float)) -> int C++: int InitPointInsertion(vtkPoints *points, const double bounds[6]) override; V.InitPointInsertion(vtkPoints, (float, float, float, float, float, float), int) -> int C++: int InitPointInsertion(vtkPoints *points, const double bounds[6], vtkIdType estSize) override; Initialize the point insertion process. points is an object, storing 3D point coordinates, to which incremental point insertion put coordinates. It is created and provided by an external VTK class. Argument bounds represents the spatial bounding box, into which the points fall. In fact, an adjusted version of the bounding box is used to build the octree to make sure no any point (to be inserted) falls outside the octree. This function is not thread safe. V.IsInsertedPoint((float, float, float)) -> int C++: vtkIdType IsInsertedPoint(const double x[3]) override; V.IsInsertedPoint(float, float, float) -> int C++: vtkIdType IsInsertedPoint(double x, double y, double z) override; Determine whether or not a given point has been inserted into the octree. Return the id of the already inserted point if true, otherwise return -1. InitPointInsertion() should have been called in advance. V.InsertUniquePoint((float, float, float), int) -> int C++: int InsertUniquePoint(const double point[3], vtkIdType &pntId) override; Insert a point to the octree unless there has been a duplciate point. Whether the point is actually inserted (return 1) or not (return 0 upon a rejection by an existing duplicate), the index of the point (either new or the duplicate) is returned via pntId. Note that InitPointInsertion() should have been called prior to this function. vtkPoints::InsertNextPoint() is invoked. This method is not thread safe. V.InsertPoint(int, (float, float, float)) C++: void InsertPoint(vtkIdType ptId, const double x[3]) override; Insert a given point into the octree with a specified point index ptId. InitPointInsertion() should have been called prior to this function. In addition, IsInsertedPoint() should have been called in advance to ensure that the given point has not been inserted unless point duplication is allowed (Note that in this case, this function involves a repeated leaf container location). vtkPoints::InsertPoint() is invoked. V.InsertNextPoint((float, float, float)) -> int C++: vtkIdType InsertNextPoint(const double x[3]) override; Insert a given point into the octree and return the point index. Note that InitPointInsertion() should have been called prior to this function. In addition, IsInsertedPoint() should have been called in advance to ensure that the given point has not been inserted unless point duplication is allowed (in this case, this function invovles a repeated leaf container location). vtkPoints::InsertNextPoint() is invoked. V.InsertPointWithoutChecking((float, float, float), int, int) C++: void InsertPointWithoutChecking(const double point[3], vtkIdType &pntId, int insert) "Insert" a point to the octree without any checking. Argument insert means whether vtkPoints::InsertNextPoint() upon 1 is called or the point itself is not inserted to the vtkPoints at all but instead only the point index is inserted to a vtkIdList upon 0. For case 0, the point index needs to be specified via pntId. For case 1, the actual point index is returned via pntId. InitPointInsertion() should have been called. vtkIncrementalPointLocatorvtkAbstractPointLocatorvtkLocatorvtkObjectUH=Hu]ÐHH=tHH=tHH=tHH=tH]HHH;u!tLJHHH;u)tLJ1HHH|$pHtHD$xH9tHH|$pHtHD$xH9tHH|$0HtHD$8H9tHL  &#A<HDGCC: (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0GNUzRx 10 D X l!   IR  EDPa AE $uEY B PD?XD(l"EAD`n AAF ED@ AG ED@ AG ED@ AG ED@ AG (ED@ AG LED@ AG pH@ I 0EFBA Dp  ABBG DEDP AG H@ E H@ E tEDP AG 8@YFBB A(D (A BBBK 8|ZFBB A(D (A BBBK gFD@ EE 0FAA D`  AABH MFF0,OFDD n ABA DDB`(tFAD` ABF 0BFBA Dp  ABBG 8iFBB A(D (A BBBK (xFCDr ABF @<FDB B(A0Dr 0A(B BBBB 0bFBA Dp  ABBG 0bFBA Dp  ABBG 8FBB A(D (A BBBK zPLRx P$FGB B(A0A8G 8A0A(B BBBB xBH@ I (/FAD` ABC (FAD` ABF HFGB A(A0Di 0A(A BBBJ \!H@ I  4!#%u" H(m`PE DF  0 tYlZpg<.i0 '' @BWix(@bob !+ "-P+B*p+/& ,s - +B! 1.0< A  F K P U Z 3_ >d $i 6n Rt nz          ) ( D P T d p          + 7 P" Z( a. P4 "1q " " " 8 "!u " " " "R ~ "   Vg"!u"#?"%DKk{98M)8^kO-l R4!2]>A~.>_ZL44PyvtkIncrementalOctreePointLocator_StaticNewv_ZL47PyvtkIncrementalOctreePointLocator_SafeDownCastP7_objectS0__ZL43PyvtkIncrementalOctreePointLocator_IsTypeOfP7_objectS0__ZL52PyvtkIncrementalOctreePointLocator_GetNumberOfPointsP7_objectS0__ZL62PyvtkIncrementalOctreePointLocator_GetMaxPointsPerLeafMaxValueP7_objectS0__ZL62PyvtkIncrementalOctreePointLocator_GetMaxPointsPerLeafMinValueP7_objectS0__ZL54PyvtkIncrementalOctreePointLocator_GetBuildCubicOctreeP7_objectS0__ZL54PyvtkIncrementalOctreePointLocator_GetMaxPointsPerLeafP7_objectS0__ZL51PyvtkIncrementalOctreePointLocator_GetLocatorPointsP7_objectS0__ZL45PyvtkIncrementalOctreePointLocator_InitializeP7_objectS0__ZL64PyvtkIncrementalOctreePointLocator_FindPointsWithinSquaredRadiusP7_objectS0__ZL54PyvtkIncrementalOctreePointLocator_SetBuildCubicOctreeP7_objectS0__ZL53PyvtkIncrementalOctreePointLocator_BuildCubicOctreeOnP7_objectS0__ZL54PyvtkIncrementalOctreePointLocator_BuildCubicOctreeOffP7_objectS0__ZL54PyvtkIncrementalOctreePointLocator_SetMaxPointsPerLeafP7_objectS0__ZL61PyvtkIncrementalOctreePointLocator_InsertPointWithoutCheckingP7_objectS0__ZL70PyvtkIncrementalOctreePointLocator_FindClosestPointWithinSquaredRadiusP7_objectS0__ZL46PyvtkIncrementalOctreePointLocator_NewInstanceP7_objectS0__ZL38PyvtkIncrementalOctreePointLocator_IsAP7_objectS0__ZL39PyvtkIncrementalOctreePointLocator_Type_ZL42PyvtkIncrementalOctreePointLocator_Methods_GLOBAL__sub_I_vtkIncrementalOctreePointLocatorPython.cxx_ZL50PyvtkIncrementalOctreePointLocator_InsertNextPointP7_objectS0__ZL46PyvtkIncrementalOctreePointLocator_InsertPointP7_objectS0__ZL52PyvtkIncrementalOctreePointLocator_InsertUniquePointP7_objectS0__ZL50PyvtkIncrementalOctreePointLocator_IsInsertedPointP7_objectS0__ZL53PyvtkIncrementalOctreePointLocator_InitPointInsertionP7_objectS0__ZL53PyvtkIncrementalOctreePointLocator_FindClosestNPointsP7_objectS0__ZL57PyvtkIncrementalOctreePointLocator_FindPointsWithinRadiusP7_objectS0__ZL63PyvtkIncrementalOctreePointLocator_FindClosestPointWithinRadiusP7_objectS0__ZL51PyvtkIncrementalOctreePointLocator_FindClosestPointP7_objectS0__ZL51PyvtkIncrementalOctreePointLocator_FindClosestPointP7_objectS0_.cold_ZL47PyvtkIncrementalOctreePointLocator_BuildLocatorP7_objectS0__ZL57PyvtkIncrementalOctreePointLocator_GenerateRepresentationP7_objectS0__ZL59PyvtkIncrementalOctreePointLocator_FindClosestInsertedPointP7_objectS0__ZL44PyvtkIncrementalOctreePointLocator_GetBoundsP7_objectS0__ZL44PyvtkIncrementalOctreePointLocator_GetBoundsP7_objectS0_.cold_ZL54PyvtkIncrementalOctreePointLocator_FreeSearchStructureP7_objectS0_.LC0.LC1.LC2.LC7.LC3.LC4.LC5.LC6.LC8.LC9.LC10.LC11.LC12.LC13.LC14.LC15.LC16.LC17.LC18.LC19.LC20.LC21.LC22.LC23.LC24.LC26.LC27.LC28.LC29.LC30.LC31.LC32.LC33.LC34.LC35.LC37.LC38.LC39.LC40.LC41.LC42.LC44.LC25_ZN32vtkIncrementalOctreePointLocator19SetMaxPointsPerLeafEi_ZN32vtkIncrementalOctreePointLocator27GetMaxPointsPerLeafMinValueEv_ZN32vtkIncrementalOctreePointLocator27GetMaxPointsPerLeafMaxValueEv_ZN32vtkIncrementalOctreePointLocator19GetMaxPointsPerLeafEv_ZN32vtkIncrementalOctreePointLocator19SetBuildCubicOctreeEi_ZN32vtkIncrementalOctreePointLocator19GetBuildCubicOctreeEv_ZN32vtkIncrementalOctreePointLocator16GetLocatorPointsEv_ZN32vtkIncrementalOctreePointLocator10InitializeEv_ZN32vtkIncrementalOctreePointLocator9GetBoundsEv_ZN32vtkIncrementalOctreePointLocator3NewEv_ZNK32vtkIncrementalOctreePointLocator19NewInstanceInternalEv_ZN13vtkPythonArgs13ArgCountErrorEii_ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRbPyErr_Occurred_ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__stack_chk_fail_ZN32vtkIncrementalOctreePointLocator3IsAEPKcstrcmp_ZN13vtkObjectBase8IsTypeOfEPKc_ZN32vtkIncrementalOctreePointLocator18BuildCubicOctreeOnEv_GLOBAL_OFFSET_TABLE__ZN32vtkIncrementalOctreePointLocator19BuildCubicOctreeOffEv_ZN13vtkPythonArgs8GetValueERPcPyLong_FromLong_ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1__ZN32vtkIncrementalOctreePointLocator17GetNumberOfPointsEv_Py_NoneStruct_ZN13vtkPythonArgs8GetValueERd_ZN13vtkPythonArgs8GetArrayEPdi_ZN32vtkIncrementalOctreePointLocator29FindPointsWithinSquaredRadiusEdPKdP9vtkIdList_ZN13vtkPythonArgs8GetValueERi_ZN13vtkPythonArgs8GetValueERx_ZN32vtkIncrementalOctreePointLocator26InsertPointWithoutCheckingEPKdRxi_ZN13vtkPythonArgs11SetArgValueEix_ZN32vtkIncrementalOctreePointLocator35FindClosestPointWithinSquaredRadiusEdPKdRdPyLong_FromLongLong_ZN13vtkPythonArgs11SetArgValueEidPyVTKObject_CheckPyVTKObject_GetObjectPyVTKObject_SetFlagPyvtkIncrementalOctreePointLocator_ClassNewPyVTKClass_AddPyvtkIncrementalPointLocator_ClassNewPyType_ReadyPyVTKAddFile_vtkIncrementalOctreePointLocatorPyDict_SetItemString_Py_Dealloc_ZN32vtkIncrementalOctreePointLocator15InsertNextPointEPKd_ZN32vtkIncrementalOctreePointLocator11InsertPointExPKd_ZN32vtkIncrementalOctreePointLocator17InsertUniquePointEPKdRx_ZN13vtkPythonArgs13ArgCountErrorEiPKc_ZN32vtkIncrementalOctreePointLocator15IsInsertedPointEPKd_ZN32vtkIncrementalOctreePointLocator15IsInsertedPointEddd_ZN32vtkIncrementalOctreePointLocator18InitPointInsertionEP9vtkPointsPKd_ZN32vtkIncrementalOctreePointLocator18InitPointInsertionEP9vtkPointsPKdx_ZN32vtkIncrementalOctreePointLocator18FindClosestNPointsEiPKdP9vtkIdList_ZN32vtkIncrementalOctreePointLocator22FindPointsWithinRadiusEdPKdP9vtkIdList_ZN32vtkIncrementalOctreePointLocator28FindClosestPointWithinRadiusEdPKdRdDW.ref.__gxx_personality_v0_ZN13vtkPythonArgs10GetArgSizeEi_ZN13vtkPythonArgs5ArrayIdEC1El_ZdaPv_ZN32vtkIncrementalOctreePointLocator16FindClosestPointEPKd_ZN32vtkIncrementalOctreePointLocator16FindClosestPointEPKdPd_ZN32vtkIncrementalOctreePointLocator16FindClosestPointEddd_ZN32vtkIncrementalOctreePointLocator16FindClosestPointEdddPd_ZN13vtkPythonArgs8SetArrayEiPKdi_Unwind_Resume_ZN32vtkIncrementalOctreePointLocator12BuildLocatorEv_ZN32vtkIncrementalOctreePointLocator22GenerateRepresentationEiP11vtkPolyData_ZN32vtkIncrementalOctreePointLocator24FindClosestInsertedPointEPKd_ZN13vtkPythonUtil13ManglePointerEPKvPKcPyUnicode_FromString_ZN32vtkIncrementalOctreePointLocator9GetBoundsEPd_ZN32vtkIncrementalOctreePointLocator19FreeSearchStructureEvPyType_TypePyVTKObject_DeletePyVTKObject_ReprPyVTKObject_StringPyObject_GenericGetAttrPyObject_GenericSetAttrPyVTKObject_AsBufferPyVTKObject_TraversePyVTKObject_GetSetPyVTKObject_NewPyObject_GC_Del,=`s>t?uvuw @Js}~?yAyuByCyDyzwAEsuwFNsqu*jwG>sazu*iwH.sQkux*mwIs1KuXm*kzwJs,u9vM*n[wKsu*2*o=wuLs 7 G MO tn s u * w N sA [  u * *l w O] s  *l u * *{ w0 P} s  *l u * *} wQ Q s  /u?*^*hwR0sauu*w7Ss  (u2uC_fwTs **r5qH?WudvxuwUfs~*x?yAyu .B3yACFyTDYyezzw;?<;;?CVsu'1weWs'Mu]*w~wXsAfzuuwYYaYsY2sSu1WgtwZZ\skZs[t.u?`[ht/;we\s'7M?tnu~*w]. sY ~   M t u *!!wG!^!s!!""E"uO"u`"z"""w$#_Y#l##s##_!$4$q$s$_$$_%s3%_%s%%%% &'&9&d&&&& '7'uH'i''9(uG(uX(y((((y)u)u))))*(*h*r*w*`*s!+>+uJ+*Y+`+w+a+s,.,>,bF,tn,u~,*,,w,c-sA-a--u---w.dL._..s..d /s/d /d/|///*p/u/* 00u0u0*0u1e1141W111w1f2sA2^2uj2*y22wq~*1*111>q?y&A+y9B>yLCQy_Ddyqz*l*lg;'6>W_ 0X8@` P(8@HX@`Dhpx0  R 6H  n(8@H X0`h x@`a1`P-$  7(,8@Hp+X`h*x" !( 0#P% (@8&@HX(`hx+p-d@/T 1)3 4H\p    (H\p ,Pt`P   0 Dp0d'x @@@ !3H"Q313P*p+,4-=3X1B31.symtab.strtab.shstrtab.rela.text.data.bss.text._ZN32vtkIncrementalOctreePointLocator19SetMaxPointsPerLeafEi.text._ZN32vtkIncrementalOctreePointLocator27GetMaxPointsPerLeafMinValueEv.text._ZN32vtkIncrementalOctreePointLocator27GetMaxPointsPerLeafMaxValueEv.text._ZN32vtkIncrementalOctreePointLocator19GetMaxPointsPerLeafEv.text._ZN32vtkIncrementalOctreePointLocator19SetBuildCubicOctreeEi.text._ZN32vtkIncrementalOctreePointLocator19GetBuildCubicOctreeEv.text._ZN32vtkIncrementalOctreePointLocator16GetLocatorPointsEv.text._ZN32vtkIncrementalOctreePointLocator10InitializeEv.text._ZN32vtkIncrementalOctreePointLocator9GetBoundsEv.rela.text._ZNK32vtkIncrementalOctreePointLocator19NewInstanceInternalEv.rodata.str1.1.rodata.str1.8.rodata._ZN32vtkIncrementalOctreePointLocator3IsAEPKc.str1.1.rela.text._ZN32vtkIncrementalOctreePointLocator3IsAEPKc.rela.text._ZN32vtkIncrementalOctreePointLocator18BuildCubicOctreeOnEv.rela.text._ZN32vtkIncrementalOctreePointLocator19BuildCubicOctreeOffEv.rela.text.startup.rela.init_array.rela.text.unlikely.gcc_except_table.rela.data.rel.rela.data.rel.local.rela.data.rel.local.DW.ref.__gxx_personality_v0.comment.note.GNU-stack.note.gnu.property.rela.eh_frame.group@9hH9iP9jX9k`9lh9mp9nx9o9p 9r 9x 9{ 9} 9 2@ %9&T3,T31`31t3 3  3 M3!4 4  4 M04P4 @92Y4u26,62lH.Pmu)@9!gm?b@9#nD@9%`n@09' xn@(9)nc@@9+)n@o ;@ 9.O q  J@ 90d@u_@920Hu,tuxu u@@97P}:h 8NH