(\\__text__TEXTi_<__gcc_except_tab__TEXTl,4"__data__DATAh"hi[__cstring__TEXT$/h'__compact_unwind__LDPTW@l__eh_frame__TEXTWZ8m h2  @maPs| P AUHH=H5H$H uHH=H]ÐUH]fDUHSPHH=H5H"$H uHH=H5#HHt H tH[]H=H[]fUHAVSH0HuHT)HEЋFEHEHEH}ȃHuH]H=W#HAtDH=RHt1H=RHtH=RHt HLcHuL1H0[A^]UHAWAVSH(HuH(HED~D}HG]ԉ]؅yHHLw(HEMA)Au{HuH}}L}tH=>"LAtuH={QLtbH=QLtOH=xQLtH}HU}t3}ut7LHHu9H}1H([A^A_]ILH8HuHH@UHAWAVSH(HuH*HED~D}HG]ԉ]؅y HHtYLw(MtPA)Au4HuH}t6HuLHHuHH}1H([A^A_]UHAWAVSH8HuH,+HED~D}HG]̉]Ѕy HHtuLw(MtlA)AuPHuH}tRH5-=H}HU}t8HuLHHuHHH}1H8[A^A_]@UHAWAVSH(HuH+HED~D}HG]ԉ]؅y HHtxLw(MtoA)AuSHuH}tU}HutXHHOI9tIILHu6H}1H([A^A_]ILHuHHf.DUHAWAVSH(HuH6.HED~D}HG]܉]y HHt#H(HtD9uAEtHt+12H}111!HIHuLHHH([A^A_]f.DUHAVSH HuH51HEDvDuHG]]y HHt'H(HtD9uEt)HHt+12H}111!HHHuHHHH [A^]f.DUHAVSH HuH24HEDvDuHG]]y HHt$H(HtD9uEt&HHt+12H}111!HHHuHHHH [A^]fUHAVSH HuH'7HEDvDuHG]]y HHtHG(HtD9uHt1H}111 HHHH [A^]f.UHAWAVAUATSHXD~HGD)؃tlHuH7HED}]]yHHLw(MD9EIXHvHuHs7HED}ȉ]̉]ЅyHHxL(H}E11AC6HcH}LmEIcI\IDME+ẼH}LDEE!ArKDH9FJI991D)HHLHtf.@ItH4HHuHDILH ILHLILHLILHLIL HL IL(HL(IL0HL0IL8HL8HI9u_H56E1H}H}E111E1ILhIHuMtH56LHIdL%I$TDHpHHH‰уH s1kHH)1ADALLAD AL0D L0AD@ALPD@LPfAD`ALpfD`LpHHuHt+HHfADALfD H HuL9}t LLILLpE~B1f.ADf.u z HI9uHuH}1LDHt,E1H}HEH9t HtLHX[A\A]A^A_]L%I$H}HEH9uHH}HEH9t HtH (ho$HD$Z*c***@+M+++k,,--./*0E0X1e111.3?3565t88$;;;W=b==>>>d?{?@@AACCFFkJJ(N>NQQHSRSvtkStaticPointLocatorvtkCommonDataModelPython.vtkStaticPointLocatorvtkStaticPointLocator - quickly locate points in 3-space Superclass: vtkAbstractPointLocator vtkStaticPointLocator is a spatial search object to quickly locate points in 3D. vtkStaticPointLocator works by dividing a specified region of space into a regular array of cuboid buckets, and then keeping a list of points that lie in each bucket. Typical operation involves giving a position in 3D and finding the closest point; or finding the N closest points. vtkStaticPointLocator is an accelerated version of vtkPointLocator. It is threaded (via vtkSMPTools), and supports one-time static construction (i.e., incremental point insertion is not supported). If you need to incrementally insert points, use the vtkPointLocator or its kin to do so. @warning This class is templated. It may run slower than serial execution if the code is not optimized during compilation. Build in Release or ReleaseWithDebugInfo. @warning Make sure that you review the documentation for the superclasses vtkAbstactPointLocator and vtkLocator. In particular the Automatic data member can be used to automatically determine divisions based on the average number of points per bucket. @warning Other types of spatial locators have been developed such as octrees and kd-trees. These are often more efficient for the operations described here. @sa vtkPointLocator vtkCellLocator vtkLocator vtkAbstractPointLocator IsTypeOfV.IsTypeOf(string) -> int C++: static vtkTypeBool IsTypeOf(const char *type) Standard type and print methods. IsAV.IsA(string) -> int C++: vtkTypeBool IsA(const char *type) override; Standard type and print methods. SafeDownCastV.SafeDownCast(vtkObjectBase) -> vtkStaticPointLocator C++: static vtkStaticPointLocator *SafeDownCast(vtkObjectBase *o) Standard type and print methods. NewInstanceV.NewInstance() -> vtkStaticPointLocator C++: vtkStaticPointLocator *NewInstance() Standard type and print methods. SetNumberOfPointsPerBucketV.SetNumberOfPointsPerBucket(int) C++: virtual void SetNumberOfPointsPerBucket(int _arg) Specify the average number of points in each bucket. This data member is used in conjunction with the Automatic data member (if enabled) to determine the number of locator x-y-z divisions. GetNumberOfPointsPerBucketMinValueV.GetNumberOfPointsPerBucketMinValue() -> int C++: virtual int GetNumberOfPointsPerBucketMinValue() Specify the average number of points in each bucket. This data member is used in conjunction with the Automatic data member (if enabled) to determine the number of locator x-y-z divisions. GetNumberOfPointsPerBucketMaxValueV.GetNumberOfPointsPerBucketMaxValue() -> int C++: virtual int GetNumberOfPointsPerBucketMaxValue() Specify the average number of points in each bucket. This data member is used in conjunction with the Automatic data member (if enabled) to determine the number of locator x-y-z divisions. GetNumberOfPointsPerBucketV.GetNumberOfPointsPerBucket() -> int C++: virtual int GetNumberOfPointsPerBucket() Specify the average number of points in each bucket. This data member is used in conjunction with the Automatic data member (if enabled) to determine the number of locator x-y-z divisions. SetDivisionsV.SetDivisions(int, int, int) C++: void SetDivisions(int, int, int) V.SetDivisions((int, int, int)) C++: void SetDivisions(int a[3]) GetDivisionsV.GetDivisions() -> (int, int, int) C++: int *GetDivisions() Set the number of divisions in x-y-z directions. If the Automatic data member is enabled, the Divisions are set according to the NumberOfPointsPerBucket and MaxNumberOfBuckets data members. The number of divisions must be >= 1 in each direction. FindClosestPointV.FindClosestPoint((float, float, float)) -> int C++: vtkIdType FindClosestPoint(const double x[3]) override; V.FindClosestPoint(float, float, float) -> int C++: vtkIdType FindClosestPoint(double x, double y, double z) Given a position x, return the id of the point closest to it. An alternative method (defined in the superclass) requires separate x-y-z values. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first. FindClosestPointWithinRadiusV.FindClosestPointWithinRadius(float, (float, float, float), float) -> int C++: vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double &dist2) override; V.FindClosestPointWithinRadius(float, (float, float, float), float, float) -> int C++: virtual vtkIdType FindClosestPointWithinRadius(double radius, const double x[3], double inputDataLength, double &dist2) Given a position x and a radius r, return the id of the point closest to the point in that radius. These methods are thread safe if BuildLocator() is directly or indirectly called from a single thread first. dist2 returns the squared distance to the point. Note that if multiple points are located the same distance away, the actual point returned is a function in which order the points are processed (i.e., indeterminate). FindClosestNPointsV.FindClosestNPoints(int, (float, float, float), vtkIdList) C++: void FindClosestNPoints(int N, const double x[3], vtkIdList *result) override; V.FindClosestNPoints(int, float, float, float, vtkIdList) C++: void FindClosestNPoints(int N, double x, double y, double z, 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. FindPointsWithinRadiusV.FindPointsWithinRadius(float, (float, float, float), vtkIdList) C++: void FindPointsWithinRadius(double R, const double x[3], vtkIdList *result) override; V.FindPointsWithinRadius(float, float, float, float, vtkIdList) C++: void FindPointsWithinRadius(double R, double x, double y, double z, 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. InitializeV.Initialize() C++: void Initialize() override; See vtkLocator and vtkAbstractPointLocator interface documentation. These methods are not thread safe. FreeSearchStructureV.FreeSearchStructure() C++: void FreeSearchStructure() override; See vtkLocator and vtkAbstractPointLocator interface documentation. These methods are not thread safe. BuildLocatorV.BuildLocator() C++: void BuildLocator() override; See vtkLocator and vtkAbstractPointLocator interface documentation. These methods are not thread safe. GenerateRepresentationV.GenerateRepresentation(int, vtkPolyData) C++: void GenerateRepresentation(int level, vtkPolyData *pd) override; Populate a polydata with the faces of the bins that potentially contain cells. Note that the level parameter has no effect on this method as there is no hierarchy built (i.e., uniform binning). Typically this is used for debugging. GetNumberOfPointsInBucketV.GetNumberOfPointsInBucket(int) -> int C++: vtkIdType GetNumberOfPointsInBucket(vtkIdType bNum) Given a bucket number bNum between 0 <= bNum < this->GetNumberOfBuckets(), return the number of points found in the bucket. GetBucketIdsV.GetBucketIds(int, vtkIdList) C++: void GetBucketIds(vtkIdType bNum, vtkIdList *bList) Given a bucket number bNum between 0 <= bNum < this->GetNumberOfBuckets(), return a list of point ids contained within the bucket. The user must provide an instance of vtkIdList to contain the result. SetMaxNumberOfBucketsV.SetMaxNumberOfBuckets(int) C++: virtual void SetMaxNumberOfBuckets(vtkIdType _arg) Set the maximum number of buckets in the locator. By default the value is set to VTK_INT_MAX. Note that there are significant performance implications at work here. If the number of buckets is set very large (meaning > VTK_INT_MAX) then internal sorting may be performed using 64-bit integers (which is much slower than using a 32-bit int). Of course, memory requirements may dramatically increase as well. It is recommended that the default value be used; but for extremely large data it may be desired to create a locator with an exceptionally large number of buckets. Note also that during initialization of the locator if the MaxNumberOfBuckets threshold is exceeded, the Divisions are scaled down in such a way as not to exceed the MaxNumberOfBuckets proportionally to the size of the bounding box in the x-y-z directions. GetMaxNumberOfBucketsMinValueV.GetMaxNumberOfBucketsMinValue() -> int C++: virtual vtkIdType GetMaxNumberOfBucketsMinValue() Set the maximum number of buckets in the locator. By default the value is set to VTK_INT_MAX. Note that there are significant performance implications at work here. If the number of buckets is set very large (meaning > VTK_INT_MAX) then internal sorting may be performed using 64-bit integers (which is much slower than using a 32-bit int). Of course, memory requirements may dramatically increase as well. It is recommended that the default value be used; but for extremely large data it may be desired to create a locator with an exceptionally large number of buckets. Note also that during initialization of the locator if the MaxNumberOfBuckets threshold is exceeded, the Divisions are scaled down in such a way as not to exceed the MaxNumberOfBuckets proportionally to the size of the bounding box in the x-y-z directions. GetMaxNumberOfBucketsMaxValueV.GetMaxNumberOfBucketsMaxValue() -> int C++: virtual vtkIdType GetMaxNumberOfBucketsMaxValue() Set the maximum number of buckets in the locator. By default the value is set to VTK_INT_MAX. Note that there are significant performance implications at work here. If the number of buckets is set very large (meaning > VTK_INT_MAX) then internal sorting may be performed using 64-bit integers (which is much slower than using a 32-bit int). Of course, memory requirements may dramatically increase as well. It is recommended that the default value be used; but for extremely large data it may be desired to create a locator with an exceptionally large number of buckets. Note also that during initialization of the locator if the MaxNumberOfBuckets threshold is exceeded, the Divisions are scaled down in such a way as not to exceed the MaxNumberOfBuckets proportionally to the size of the bounding box in the x-y-z directions. GetMaxNumberOfBucketsV.GetMaxNumberOfBuckets() -> int C++: virtual vtkIdType GetMaxNumberOfBuckets() Set the maximum number of buckets in the locator. By default the value is set to VTK_INT_MAX. Note that there are significant performance implications at work here. If the number of buckets is set very large (meaning > VTK_INT_MAX) then internal sorting may be performed using 64-bit integers (which is much slower than using a 32-bit int). Of course, memory requirements may dramatically increase as well. It is recommended that the default value be used; but for extremely large data it may be desired to create a locator with an exceptionally large number of buckets. Note also that during initialization of the locator if the MaxNumberOfBuckets threshold is exceeded, the Divisions are scaled down in such a way as not to exceed the MaxNumberOfBuckets proportionally to the size of the bounding box in the x-y-z directions. GetLargeIdsV.GetLargeIds() -> bool C++: bool GetLargeIds() Inform the user as to whether large ids are being used. This flag only has meaning after the locator has been built. Large ids are used when the number of binned points, or the number of bins, is >= the maximum number of buckets (specified by the user). Note that LargeIds are only available on 64-bit architectures. GetBoundsV.GetBounds() -> (float, ...) C++: virtual double *GetBounds() V.GetBounds([float, ...]) C++: virtual void GetBounds(double *) Provide an accessor to the bounds. vtkAbstractPointLocatorvtkLocatorvtkObjectvtkObjectBasevtkIdListvtkPolyDatap_voidOP `!:a!!aapa0! a @ f!!@!aaa`a`a !!!09XAlzRx $OAC $D AC $lAC B$hAC G$ :AC I$8AC G$ AC G$4AC I$\`AC I$AC I$AC G$AC E$AC I$$AC E$LfAC E$tHAC E$0AC E$(AC G$AC G$8AC G$<AC I$dAC I$AC I$AC I$AC I$(AC G$,AC G$THAC GzPLRx 4$9AC Mc9-[\-.8=\-"-I-"-[-8=*-J-"-g?-R?-7>-0SC-B-<-A-"-A-m -?-"-A-{$-n"-[?-C"-A-$-"-?-"-\A-2$-"-?-"-A-tH8=<"-?-"-H-A-tK?-38='"-"N- @-H-A-?-j$-]"-UT-EH-A-8="-?-"-S-m@-`UG-.A-8="-?-"-M-|A-R%8="- ?-"-Q-A-u8=i"-Y?-A"-<L-A-^-_=8="-u_=l>-e\Z-7@-*F-F-F-F-A-R-x@-k\C-BF-A-_=^-_=8="-a_=X>-QHY-%@- F-F-F-G-A-P-h@-[LC-2G- A-_=^-_=$-x"-s=-["-*"- _= >-  V- F- F-z C-d F-> A-(  U- F- C- F- A- L _=. ^- _= $- "- _= >-  X- F- F- F-g A-Q A O-# C- A-  _= ;-s "-] ?-E "- A-  ^- _= 8= "-z _=q >-j \ "-8 D- A-"-G-wG-bG-<A-&_=#-"-?-"-lA-B #-"-?-"-A-L#-?"-,?-"-A-8="-w?-]"-%G-A-3-/---sK-f"-\?-F"-2A-K-"-?-y"-eM@-@"#-"-?-:-`-`-`-wf`-^EE-A-?-#-"-:-`-y`-qf`-^M`-E2E-7-!-(-6-+-zslVW-IB(-=6/6-'!+-xh`XH@8( xh`XH@8(     xh `XH@8( @%8105,'&4X20.)]`@ `@ `@ `@ ]M@!P $   p 0   I  R @  Q  @  9  `h`  W p  0Rl`[v0X?"E qqh/J=R"bkM>Zh/ me?_PyType_Ready__ZN13vtkPythonArgs8GetValueERx__ZN21vtkStaticPointLocator25GetNumberOfPointsInBucketEx_PyvtkAbstractPointLocator_ClassNew_PyvtkStaticPointLocator_ClassNew_PyVTKObject_New__ZL33PyvtkStaticPointLocator_StaticNewv__ZdaPv__ZN21vtkStaticPointLocator3NewEv__ZN21vtkStaticPointLocator12BuildLocatorEv__ZN21vtkStaticPointLocator10InitializeEv__ZN21vtkStaticPointLocator19FreeSearchStructureEv__ZN21vtkStaticPointLocator12GetBucketIdsExP9vtkIdList__ZN23vtkAbstractPointLocator18FindClosestNPointsEidddP9vtkIdList__ZN23vtkAbstractPointLocator22FindPointsWithinRadiusEddddP9vtkIdList__ZN21vtkStaticPointLocator18FindClosestNPointsEiPKdP9vtkIdList__ZN21vtkStaticPointLocator22FindPointsWithinRadiusEdPKdP9vtkIdList_PyVTKObject_GetSet__Py_NoneStruct_PyVTKObject_GetObject__ZL31PyvtkStaticPointLocator_Methods_PyObject_GenericSetAttr_PyObject_GenericGetAttr_PyVTKObject_Repr_PyVTKAddFile_vtkStaticPointLocator_PyVTKObject_AsBuffer_strcmp___stack_chk_fail_PyObject_GC_Del__ZN13vtkPythonArgs5ArrayIdEC1El_PyVTKObject_Check__ZN13vtkPythonArgs8GetArrayEPii__ZN13vtkPythonArgs10BuildTupleEPKii__ZN13vtkPythonArgs13ArgCountErrorEii__ZN13vtkPythonArgs8GetArrayEPdi__ZN13vtkPythonArgs8SetArrayEiPKdi__ZN13vtkPythonArgs8GetValueERi__ZN13vtkPythonArgs10GetArgSizeEi_PyBool_FromLong_PyLong_FromLong_PyLong_FromLongLong_PyUnicode_FromString_PyDict_SetItemString_PyVTKObject_String_PyVTKObject_SetFlag_PyVTKObject_Delete_PyVTKObject_Traverse__ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__ZL28PyvtkStaticPointLocator_Type_PyType_Type__Unwind_Resume___stack_chk_guard__ZN13vtkPythonArgs11SetArgValueEid_PyErr_Occurred__ZN23vtkAbstractPointLocator16FindClosestPointEddd_PyVTKClass_Add__ZN21vtkStaticPointLocator28FindClosestPointWithinRadiusEdPKddRd__ZN21vtkStaticPointLocator28FindClosestPointWithinRadiusEdPKdRd__ZN13vtkPythonArgs8GetValueERd__ZN23vtkAbstractPointLocator9GetBoundsEPd__ZN21vtkStaticPointLocator16FindClosestPointEPKd__Py_Dealloc__ZN13vtkPythonArgs8GetValueERPc__ZN13vtkPythonUtil13ManglePointerEPKvPKc__ZN13vtkPythonArgs13ArgCountErrorEiPKc__ZN13vtkObjectBase8IsTypeOfEPKc__ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRb__ZN21vtkStaticPointLocator22GenerateRepresentationEiP11vtkPolyData__ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1___ZL36PyvtkStaticPointLocator_SafeDownCastP7_objectS0___ZL40PyvtkStaticPointLocator_FindClosestPointP7_objectS0___ZL50PyvtkStaticPointLocator_SetNumberOfPointsPerBucketP7_objectS0___ZL50PyvtkStaticPointLocator_GetNumberOfPointsPerBucketP7_objectS0___ZL49PyvtkStaticPointLocator_GetNumberOfPointsInBucketP7_objectS0___ZL52PyvtkStaticPointLocator_FindClosestPointWithinRadiusP7_objectS0___ZL46PyvtkStaticPointLocator_FindPointsWithinRadiusP7_objectS0___ZL42PyvtkStaticPointLocator_FindClosestNPointsP7_objectS0___ZL45PyvtkStaticPointLocator_SetMaxNumberOfBucketsP7_objectS0___ZL45PyvtkStaticPointLocator_GetMaxNumberOfBucketsP7_objectS0___ZL36PyvtkStaticPointLocator_SetDivisionsP7_objectS0___ZL36PyvtkStaticPointLocator_GetDivisionsP7_objectS0___ZL33PyvtkStaticPointLocator_GetBoundsP7_objectS0___ZL36PyvtkStaticPointLocator_GetBucketIdsP7_objectS0___ZL35PyvtkStaticPointLocator_GetLargeIdsP7_objectS0___ZL36PyvtkStaticPointLocator_BuildLocatorP7_objectS0___ZL46PyvtkStaticPointLocator_GenerateRepresentationP7_objectS0___ZL32PyvtkStaticPointLocator_IsTypeOfP7_objectS0___ZL34PyvtkStaticPointLocator_InitializeP7_objectS0___ZL58PyvtkStaticPointLocator_GetNumberOfPointsPerBucketMaxValueP7_objectS0___ZL53PyvtkStaticPointLocator_GetMaxNumberOfBucketsMaxValueP7_objectS0___ZL58PyvtkStaticPointLocator_GetNumberOfPointsPerBucketMinValueP7_objectS0___ZL53PyvtkStaticPointLocator_GetMaxNumberOfBucketsMinValueP7_objectS0___ZL43PyvtkStaticPointLocator_FreeSearchStructureP7_objectS0___ZL35PyvtkStaticPointLocator_NewInstanceP7_objectS0___ZL27PyvtkStaticPointLocator_IsAP7_objectS0_GCC_except_table28___gxx_personality_v0