ELF>(@@TS !"#$%&'(),-./0123456789:;<=JKUH@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=tH@SH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uZH0[fDHHuӐtHuHcHHPH;tЉff.fSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uZH0[fDHHuӐtHuHcHHXH;tЉff.fSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uUH0[fDHHuӐt_XHuHcDHH`H;tЉfSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uUH0[fDHHuӐt_`HuHcDHHpH;tЉfSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uUH0[fDHHuӐt_\HuHcDHHH;tЉfSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uUH0[fDHHuӐt_dHuHcDHHH;tЉfSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uUH0[fDHHuӐt_hHuHcDHHH;tЉfUH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(H@]fDHHuϐHt$ H|$tD$$t$ t19uhtHEuhHHuHHDHEHH;u;uhtˉuhHfH@UH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(H@]fDHHuϐHt$ H|$tD$$t$ t19u\tHEu\HHuHHDHEHH;u;u\tˉu\HfH@UH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(H@]fDHHuϐHt$ H|$tD$$t$ t19u`tHEu`HHuHHDHEHhH;u;u`tˉu`HfH@UH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(H@]fDHHuϐHt$ H|$tD$$t$ t19udtHEudHHuHHDHEHH;u;udtˉudHfH@H8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(H8@HHuҐHtAHH;uIdt GdHuHHHH;t@fH8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(H8@HHuҐHtAHH;uI\t G\HuHHHH;t@fH8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(H8@HHuҐHtAHH;uIGdt GdHuHHfDHH;t@1DH8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(H8@HHuҐHtAHH;uIht GhHuHHHH;t@fH8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(H8@HHuҐHtAHH;uIG\t G\HuHHfDHH;t@1DH8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(H8@HHuҐHtAHhH;uI`t G`HuHHHxH;t@fH8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(H8@HHuҐHtAHhH;uIG`t G`HuHHfDHH;t@1DH8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(H8@HHuҐHtAHH;uIGht GhHuHHfDHH;t@1DUH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(H@]fDHHuϐHt$ H|$tD$$t$ tAN9uXtHEuXHHuHHxHEHHH;u$N9uXtuXHHff.ATUSH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uYHD$Ho(Ht!\$ +\$$tJH|$1HT$8dH+%(H@[]A\HHuːHt$H|$tD$$Ld$uXHELH@H;ulH=tLH=u)HeHcZfDLLH=tL븐HЉfATH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$uDH(HtD$9D$tIH11E1HD$(dH+%(H0LA\@HHufHHRxH;IMtoI$H5LPtZHuLIHoHbL1HHP@L8fE1H"DIjfATL%1HH5LuLHLA\ATIUHHt HH5LHtHmtH]A\HH]A\AVAUATUSH`fnFdH%(HD$X1HHt$ HD$(HGfnȉD$8fbfD$0uUHo(Ht!D$0+D$4tOH|$ 1HT$XdH+%(H`[]A\A]A^HHuƐLl$@Ld$ LLtHt$LtD$4T$HD$@\$PHT$fH~fI~D$~HEHLPD$f.D$@z>u8fInf.$$HbLL|$pHLHt$HHHT$GH5H|$GH$H$HHHD$qDLH[t$x|$pt$$|$$t$8$|$($t$ |$0E~[IEH9AD$D1HffAl,HH9uDAt ADËD$dD$HIHL$MLH$LHt$f.t$pI|$f.|$xl$8f.$t$ f.$QK|$(f.$60t$0f.$E~2Ic1 @HH9tADf.ztHkHLH$fDLIHH|$PH$4HcH$1I8L1.LIHH1DLLIDHL1HHHT$HHbL1HKHL$H$MLLD1ADHH9uDLH}Hff.fAWAVAUATUSHfnFdH%(H$1HHt$0HD$8HGfnЉD$HfbfD$@u]Lw(Mt!D$@+D$DtWH|$01H$dH+%(HĘ[]A\A]A^A_HHu뾐Ld$PHl$0LHtLl$pHLtHt$(HqHT$'H5H|$'HOD$D\$XL$Pd$`l$xt$p$$D$(d$fI~fH~L$|$ILLL8L$f.L$P$$f.d$Xt$f.t$`fHnf.\$pz[uYfInf.l$xzLuJ|$f.$z9u7H]HHOLLLL$WHuLHHiL1HRff.AVAUATUSHpfnFdH%(HD$h1HHt$HD$HGfnȉD$(fbfD$ Hl$Lw(11HH|$04AHcLl$0EuoMD$ +D$$HH|$0E1HtHD$8H9tHD$hdH+%(HpL[]A\A]A^IcI\fDHH>H|$1E1H|$04HcH|$0IsLE1hDLHGHT$H5H|$I%E~WIEH9AD$D1HDfATHH9uDAt ADËD$$ILLL0E~,Ic1 fHH9tADf.ztHt'H|$0E1HlL%I$[DL1H@LLLDD1ADHH9u:HDAW1AVAUATUSHHNdH%(H$1HGAfnH%fnA)fbAtWAAH5D1H$dH+%( H[]A\A]A^A_fHHt$pH\$x$$$HL(M$+$H|$p1`fHHt$pH\$x$fք$HL(Mt+$+$H|$p1HHt$pH\$x$$$Hu}L(Mt‹$+$H|$p1fHH1vHH)1VHHr16L$Hl$pLH Ht$XHL$HLH\$hH5HH|$hHD$Lt$`HLHT$PHHHT$xHHeLL$THLLL$HH$D$X$LL$H$L$0$$$T$($\$@l$ t$|$8IMAQLSLLL$ LHL$(Y^IL$(f.$T$0f.$mg\$@f.$RLl$f.$ t$ f.$|$8f.$HHHzHbT$THLL$Hl$pLHHt$XHL$HLdLt$`HLLH\$THH4LL$hHLLL$$LL$$D$X$$$\$0$$L$(l$ t$|$T$ILILLLT$L$(\$0If.$82f.$#f.$l$f.$t$ f.$|$f.$HHvHJD$hH2fDL$Hl$pLHyHt$XHdL$HLDH\$hH5HH|$hHD$Lt$`HLLL$THLLL$HH$D$X$LL$$$$L$ $$T$\$8l$@t$(|$0ARIMLSLHL$L A[[IL$f.$T$ f.$qk\$8f.$VPl$(f.$ t$@f.$|$0f.$HHHHdLWHcLHIHL1HLILLL\$0L$(T$IfHT$`HHLHHL1HWMLLSHL$LAXAYIT$THtHLHHL1HAQMLLSLL$ LHL$IXZHT$`HD$hH#T$THHT$`HjD$hHnT$PHJff.AW1AVAUATUSHHNdH%(H$1HGAfnH%fnA)fbAtGAH5D1H$dH+%(H[]A\A]A^A_HHt$`H\$hL$pT$tT$xHL(MD$p+D$t|H|$`1uHHt$`H\$hT$xfD$pH\L(Mt%D$p+D$tH|$`1L$Hl$`LHtL$HLtLl$PHLtH\$LHHtLL$XHLLL$pDD$tLL$$$$E$$L$0$d$(l$t$|$ D$iIILLLLD$L$0f.$}f.$nhl$(f.$SMT$f.$ d$f.$t$ f.$H)HH)D$XHDL$Hl$`LHL$HLH\$XH5HH|$XHD$Ll$PHL~LL$LHLLL$aHHN$|$t$LL$$|$ $$T$$L$8|$l$(D$05IHLMSLHL$LY^T$D$0L$8f.$f.$f.$t$f.$a[T$ f.$F@d$(f.$+%HHH|HHHfDHH1HH1ILLLLL$0D$HLHHL1HT$LHHT$PHHLHHTL1H=HLMLSHL$LXZL$8D$0T$D$XHlT$LHHHT$PH#ff.AW1AVAUATUSHHHNdH%(H$81HGAfnH%fnA)fbAACAHH$H$$$$H,Lw(Mg$+$@H$1fA urHH$H$$fք$HH_(H$+$ H$ 1H5D1H$8dH+%( HH[]A\A]A^A_HH$H$$$$HHo(Ht2$+$s H$@1YfHH$H$$$$Hu_H_(Ht$+$H$1HH41HHu1@HH1HH%1xL$H$LHL$HLH$HH$HHHD$L$HLpH$ HHH\$KH$HH0$$$$$T$`$$\$X$$d$p$$l$8$(t$0$ |$h$0T$H\$@d$Pl$ t$|$(8 PILMSLLL$ LHL$XZT$Xf.$  \$`f.$  d$pf.$  l$0f.$` Z t$8f.$E ? |$hf.$* $ H T$@f.$\$Hf.$d$Pf.$l$f.$ ^Xt$ f.$(C=|$(f.$0("H HHcDL$H$LHL$HLpH$HXL$HL=L$HLH$ HHHD$H$HHHL$H$HHHT$$$$$$T$ $$\$P$d$p$$$l$($(t$H$ |$h$0T$0\$xd$`l$@t$8|$XHMt$Ht$ LLLLL$ AXAYT$Pf.$LF\$ f.$1+d$pf.$l$Hf.$t$(f.$|$hf.$H(T$xf.$\$0f.$d$`f.$l$8f.$ t$@f.$(|$Xf.$0HH|H$Hbf.L$H$LHL$HLH$HL$HLL$HLH$ HHHD$pH$HHHL$PH$HHHT$0H$H5H$ $$$$$T$H$$\$P$d$x$$$l$`$(t$h$ |$p$0T$(\$ d$Xl$8t$0|$@QLHMPLLLt$t$0LL$0AH T$Pf.$qk\$Hf.$VPd$xf.$;5l$hf.$t$`f.$|$pf.$HT$ f.$;5\$(f.$ d$Xf.$l$0f.$ z*u(t$8f.$(zu|$@f.$0`HXHT$H<@L$L$LLL$ LL`L$H5LL$8LH5LHD$$I$HL$u HELLHfDLLHHHT$HHULH;HLHHUL1H>ARLMLSLL$ LHL$A[A^H/LH$H$H$H'H[LHAHL1Ht$HLMt$ LLLL$ ^_PHLH$H$HRH6LHHL1HRHMLPLLt$t$0LL$0H 'N9wXt HwXGX9w`tHw`G`9w\tHw\G\9wdtHwdGd9whtHwhGhSafeDownCastvtkObjectBasevtkAbstractCellLocatorIsTypeOfGetNumberOfCellsPerNodeGetCacheCellBoundsGetRetainCellListsGetLazyEvaluationGetUseExistingSearchStructureSetUseExistingSearchStructureSetRetainCellListsSetCacheCellBoundsSetLazyEvaluationLazyEvaluationOnRetainCellListsOnLazyEvaluationOffUseExistingSearchStructureOnRetainCellListsOffCacheCellBoundsOnCacheCellBoundsOffUseExistingSearchStructureOffSetNumberOfCellsPerNodeIsANewInstanceInsideCellBoundsFindCellvtkGenericCellFindCellsAlongLinevtkIdListFindCellsWithinBoundsFindClosestPointWithinRadiusFindClosestPointIntersectWithLinevtkPointsvtkLocatorvtkObjectUH=Hu]ÐHH=tHH=tH]HHhH;u!`tG`fDHHhH;u!W`tG`D1HHH;u!\tG\fDHHH;u!W\tG\D1HHH;u!dtGdfDHHH;u!WdtGdD1HHH;u!htGhfDHHH;u!WhtGhD1GetNumberOfCellsPerNodeMinValueGetNumberOfCellsPerNodeMaxValuevtkAbstractCellLocator - 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; @sa vtkLocator vtkPointLocator vtkOBBTree vtkCellLocator vtkCommonDataModelPython.vtkAbstractCellLocatorV.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) -> vtkAbstractCellLocator C++: static vtkAbstractCellLocator *SafeDownCast(vtkObjectBase *o) Standard type and print methods. V.NewInstance() -> vtkAbstractCellLocator C++: vtkAbstractCellLocator *NewInstance() Standard type and print methods. V.SetNumberOfCellsPerNode(int) 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. V.GetNumberOfCellsPerNodeMinValue() -> int C++: virtual int GetNumberOfCellsPerNodeMinValue() Specify the preferred/maximum number of cells in each node/bucket. Default 32. Locators generally operate by subdividing space into smaller regions until the number of cells in each region (or node) reaches the desired level. V.GetNumberOfCellsPerNodeMaxValue() -> int C++: virtual int GetNumberOfCellsPerNodeMaxValue() Specify the preferred/maximum number of cells in each node/bucket. Default 32. Locators generally operate by subdividing space into smaller regions until the number of cells in each region (or node) reaches the desired level. V.GetNumberOfCellsPerNode() -> int C++: virtual int GetNumberOfCellsPerNode() Specify the preferred/maximum number of cells in each node/bucket. Default 32. Locators generally operate by subdividing space into smaller regions until the number of cells in each region (or node) reaches the desired level. V.SetCacheCellBounds(int) C++: virtual void SetCacheCellBounds(int _arg) Boolean controls whether the bounds of each cell are computed only once and then saved. Should be 10 to 20% faster if repeatedly calling any of the Intersect/Find routines and the extra memory won't cause disk caching (24 extra bytes per cell are required to save the bounds). V.GetCacheCellBounds() -> int C++: virtual int GetCacheCellBounds() Boolean controls whether the bounds of each cell are computed only once and then saved. Should be 10 to 20% faster if repeatedly calling any of the Intersect/Find routines and the extra memory won't cause disk caching (24 extra bytes per cell are required to save the bounds). V.CacheCellBoundsOn() C++: virtual void CacheCellBoundsOn() Boolean controls whether the bounds of each cell are computed only once and then saved. Should be 10 to 20% faster if repeatedly calling any of the Intersect/Find routines and the extra memory won't cause disk caching (24 extra bytes per cell are required to save the bounds). V.CacheCellBoundsOff() C++: virtual void CacheCellBoundsOff() Boolean controls whether the bounds of each cell are computed only once and then saved. Should be 10 to 20% faster if repeatedly calling any of the Intersect/Find routines and the extra memory won't cause disk caching (24 extra bytes per cell are required to save the bounds). V.SetRetainCellLists(int) C++: virtual void SetRetainCellLists(int _arg) Boolean controls whether to maintain list of cells in each node. not applicable to all implementations, but if the locator is being used as a geometry simplification technique, there is no need to keep them. V.GetRetainCellLists() -> int C++: virtual int GetRetainCellLists() Boolean controls whether to maintain list of cells in each node. not applicable to all implementations, but if the locator is being used as a geometry simplification technique, there is no need to keep them. V.RetainCellListsOn() C++: virtual void RetainCellListsOn() Boolean controls whether to maintain list of cells in each node. not applicable to all implementations, but if the locator is being used as a geometry simplification technique, there is no need to keep them. V.RetainCellListsOff() C++: virtual void RetainCellListsOff() Boolean controls whether to maintain list of cells in each node. not applicable to all implementations, but if the locator is being used as a geometry simplification technique, there is no need to keep them. V.SetLazyEvaluation(int) C++: virtual void SetLazyEvaluation(int _arg) Most Locators build their search structures during BuildLocator but some may delay construction until it is actually needed. If LazyEvaluation is supported, this turns on/off the feature. if not supported, it is ignored. V.GetLazyEvaluation() -> int C++: virtual int GetLazyEvaluation() Most Locators build their search structures during BuildLocator but some may delay construction until it is actually needed. If LazyEvaluation is supported, this turns on/off the feature. if not supported, it is ignored. V.LazyEvaluationOn() C++: virtual void LazyEvaluationOn() Most Locators build their search structures during BuildLocator but some may delay construction until it is actually needed. If LazyEvaluation is supported, this turns on/off the feature. if not supported, it is ignored. V.LazyEvaluationOff() C++: virtual void LazyEvaluationOff() Most Locators build their search structures during BuildLocator but some may delay construction until it is actually needed. If LazyEvaluation is supported, this turns on/off the feature. if not supported, it is ignored. V.SetUseExistingSearchStructure(int) C++: virtual void SetUseExistingSearchStructure(int _arg) Some locators support querying a new dataset without rebuilding the search structure (typically this may occur when a dataset changes due to a time update, but is actually the same topology) Turning on this flag enables some locators to skip the rebuilding phase V.GetUseExistingSearchStructure() -> int C++: virtual int GetUseExistingSearchStructure() Some locators support querying a new dataset without rebuilding the search structure (typically this may occur when a dataset changes due to a time update, but is actually the same topology) Turning on this flag enables some locators to skip the rebuilding phase V.UseExistingSearchStructureOn() C++: virtual void UseExistingSearchStructureOn() Some locators support querying a new dataset without rebuilding the search structure (typically this may occur when a dataset changes due to a time update, but is actually the same topology) Turning on this flag enables some locators to skip the rebuilding phase V.UseExistingSearchStructureOff() C++: virtual void UseExistingSearchStructureOff() Some locators support querying a new dataset without rebuilding the search structure (typically this may occur when a dataset changes due to a time update, but is actually the same topology) Turning on this flag enables some locators to skip the rebuilding phase V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int) -> int C++: virtual int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int, int) -> int C++: virtual int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId, vtkIdType &cellId) V.IntersectWithLine([float, float, float], [float, float, float], float, float, [float, float, float], [float, float, float], int, int, vtkGenericCell) -> int C++: virtual int IntersectWithLine(double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId, vtkIdType &cellId, vtkGenericCell *cell) V.IntersectWithLine((float, float, float), (float, float, float), vtkPoints, vtkIdList) -> int C++: virtual int IntersectWithLine(const double p1[3], const double p2[3], vtkPoints *points, vtkIdList *cellIds) Return intersection point (if any) of finite line with cells contained in cell locator. See vtkCell.h parameters documentation. V.FindClosestPoint([float, float, float], [float, float, float], int, int, float) C++: virtual void FindClosestPoint(double x[3], double closestPoint[3], vtkIdType &cellId, int &subId, double &dist2) V.FindClosestPoint([float, float, float], [float, float, float], vtkGenericCell, int, int, float) C++: virtual void FindClosestPoint(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. V.FindClosestPointWithinRadius([float, float, float], float, [float, float, float], int, int, float) -> int C++: virtual vtkIdType FindClosestPointWithinRadius(double x[3], double radius, double closestPoint[3], vtkIdType &cellId, int &subId, double &dist2) V.FindClosestPointWithinRadius([float, float, float], float, [float, float, float], vtkGenericCell, int, int, float) -> int C++: virtual vtkIdType FindClosestPointWithinRadius(double x[3], double radius, double closestPoint[3], vtkGenericCell *cell, vtkIdType &cellId, int &subId, double &dist2) V.FindClosestPointWithinRadius([float, float, float], float, [float, float, float], vtkGenericCell, int, int, float, 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. V.FindCellsWithinBounds([float, ...], vtkIdList) 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 method returns data only after the locator has been built. V.FindCellsAlongLine([float, float, float], [float, float, float], float, vtkIdList) C++: virtual void FindCellsAlongLine(double p1[3], double p2[3], double tolerance, vtkIdList *cells) Given a finite line defined by the two points (p1,p2), return the list of unique cell ids in the buckets containing the line. It is possible that an empty cell list is returned. The user must provide the vtkIdList to populate. This method returns data only after the locator has been built. V.FindCell([float, float, float]) -> int C++: virtual vtkIdType FindCell(double x[3]) V.FindCell([float, float, float], float, vtkGenericCell, [float, float, float], [float, ...]) -> int C++: virtual vtkIdType FindCell(double x[3], double tol2, vtkGenericCell *GenCell, 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 V.InsideCellBounds([float, float, float], 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. HHH$HtH$H9tHH|$0HD$8H9t HtH%e    "o2HDGCC: (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0GNUzRx !0 D Xl  EDPa AE DOEY B jd?x<?<?<?<(EAD`n AAF 0ED@ AG TED@ AG xED@ AG ED@ AG ED@ AG ED@ AG ED@ AG ,<EDP AG P<EDP AG t<EDP AG <EDP AG H@ E H@ E  H@ E H@ E , H@ E HH@ E d H@ E  H@ E TEDP AG 0nFAA D`  AABH gFD@ EE HFA04OFDD n ABA DDBh@|FBB A(A0D 0A(A BBBI zPLRx L$sFGB B(A0A8Gp 8A0A(B BBBD t'HTFBB B(A0A8G 8A0A(B BBBI DFBB A(A0D 0D(A BBBD ,! D FDB B(A0A8G 8A0A(B BBBJ DWARJSAJOBrJVAl"FDB B(A0A8G{ 8A0A(B BBBD GRAJNAFDB B(A0A8G 8A0A(B BBBH  JYA\GVBJMDRJTBMQAJJDN3 !"#$%&'(*,.02468:<8>kA~`@? <` < < <= x0@ P7` tp  5TwnpgFH?$?TC@sEC'"7p%wC'!@(D 3">:FHz** **2++ >> *;*S*f*y********"*4*Q*d*v * * * * * *$ ** *0 * 6 *< *+B *HH *YN *kT >@Z "! " "  "F " x "! "" "# "$? "%p "& "' "(  2 W     ",O  ( ".?Y o "0< "2? "4<"6?4"8<e":?"<<CbqH0O%:Ff!J,Mmt`.Q>W2GZj_ZL37PyvtkAbstractCellLocator_SafeDownCastP7_objectS0__ZL33PyvtkAbstractCellLocator_IsTypeOfP7_objectS0__ZL56PyvtkAbstractCellLocator_GetNumberOfCellsPerNodeMinValueP7_objectS0__ZL56PyvtkAbstractCellLocator_GetNumberOfCellsPerNodeMaxValueP7_objectS0__ZL48PyvtkAbstractCellLocator_GetNumberOfCellsPerNodeP7_objectS0__ZL43PyvtkAbstractCellLocator_GetCacheCellBoundsP7_objectS0__ZL43PyvtkAbstractCellLocator_GetRetainCellListsP7_objectS0__ZL42PyvtkAbstractCellLocator_GetLazyEvaluationP7_objectS0__ZL54PyvtkAbstractCellLocator_GetUseExistingSearchStructureP7_objectS0__ZL54PyvtkAbstractCellLocator_SetUseExistingSearchStructureP7_objectS0__ZL43PyvtkAbstractCellLocator_SetRetainCellListsP7_objectS0__ZL43PyvtkAbstractCellLocator_SetCacheCellBoundsP7_objectS0__ZL42PyvtkAbstractCellLocator_SetLazyEvaluationP7_objectS0__ZL41PyvtkAbstractCellLocator_LazyEvaluationOnP7_objectS0__ZL42PyvtkAbstractCellLocator_RetainCellListsOnP7_objectS0__ZL42PyvtkAbstractCellLocator_LazyEvaluationOffP7_objectS0__ZL53PyvtkAbstractCellLocator_UseExistingSearchStructureOnP7_objectS0__ZL43PyvtkAbstractCellLocator_RetainCellListsOffP7_objectS0__ZL42PyvtkAbstractCellLocator_CacheCellBoundsOnP7_objectS0__ZL43PyvtkAbstractCellLocator_CacheCellBoundsOffP7_objectS0__ZL54PyvtkAbstractCellLocator_UseExistingSearchStructureOffP7_objectS0__ZL48PyvtkAbstractCellLocator_SetNumberOfCellsPerNodeP7_objectS0__ZL28PyvtkAbstractCellLocator_IsAP7_objectS0__ZL36PyvtkAbstractCellLocator_NewInstanceP7_objectS0__ZL29PyvtkAbstractCellLocator_Type_ZL32PyvtkAbstractCellLocator_Methods_GLOBAL__sub_I_vtkAbstractCellLocatorPython.cxx_ZL41PyvtkAbstractCellLocator_InsideCellBoundsP7_objectS0__ZL33PyvtkAbstractCellLocator_FindCellP7_objectS0__ZL33PyvtkAbstractCellLocator_FindCellP7_objectS0_.cold_ZL43PyvtkAbstractCellLocator_FindCellsAlongLineP7_objectS0__ZL46PyvtkAbstractCellLocator_FindCellsWithinBoundsP7_objectS0__ZL46PyvtkAbstractCellLocator_FindCellsWithinBoundsP7_objectS0_.cold_ZL53PyvtkAbstractCellLocator_FindClosestPointWithinRadiusP7_objectS0__ZL41PyvtkAbstractCellLocator_FindClosestPointP7_objectS0__ZL42PyvtkAbstractCellLocator_IntersectWithLineP7_objectS0_.LC0.LC1.LC2.LC5.LC3.LC4.LC6.LC7.LC8.LC9.LC10.LC11.LC12.LC13.LC14.LC15.LC16.LC17.LC18.LC19.LC20.LC21.LC22.LC23.LC24.LC25.LC26.LC27.LC29.LC30.LC31.LC33.LC34.LC35.LC37.LC38.LC39.LC40.LC28_ZN22vtkAbstractCellLocator23SetNumberOfCellsPerNodeEi_ZN22vtkAbstractCellLocator31GetNumberOfCellsPerNodeMinValueEv_ZN22vtkAbstractCellLocator31GetNumberOfCellsPerNodeMaxValueEv_ZN22vtkAbstractCellLocator23GetNumberOfCellsPerNodeEv_ZN22vtkAbstractCellLocator18SetCacheCellBoundsEi_ZN22vtkAbstractCellLocator18GetCacheCellBoundsEv_ZN22vtkAbstractCellLocator18SetRetainCellListsEi_ZN22vtkAbstractCellLocator18GetRetainCellListsEv_ZN22vtkAbstractCellLocator17SetLazyEvaluationEi_ZN22vtkAbstractCellLocator17GetLazyEvaluationEv_ZN22vtkAbstractCellLocator29SetUseExistingSearchStructureEi_ZN22vtkAbstractCellLocator29GetUseExistingSearchStructureEv_ZNK22vtkAbstractCellLocator19NewInstanceInternalEv_ZN9vtkObject3NewEv_ZN13vtkPythonArgs13ArgCountErrorEii_ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRbPyErr_Occurred_ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__stack_chk_fail_ZN22vtkAbstractCellLocator3IsAEPKcstrcmp_ZN13vtkObjectBase8IsTypeOfEPKc_ZN22vtkAbstractCellLocator17CacheCellBoundsOnEv_GLOBAL_OFFSET_TABLE__ZN22vtkAbstractCellLocator18CacheCellBoundsOffEv_ZN22vtkAbstractCellLocator17RetainCellListsOnEv_ZN22vtkAbstractCellLocator18RetainCellListsOffEv_ZN22vtkAbstractCellLocator16LazyEvaluationOnEv_ZN22vtkAbstractCellLocator17LazyEvaluationOffEv_ZN22vtkAbstractCellLocator28UseExistingSearchStructureOnEv_ZN22vtkAbstractCellLocator29UseExistingSearchStructureOffEv_ZN13vtkPythonArgs8GetValueERPcPyLong_FromLong_ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1__ZN13vtkPythonArgs8GetValueERi_Py_NoneStructPyVTKObject_CheckPyVTKObject_GetObjectPyVTKObject_SetFlagPyvtkAbstractCellLocator_ClassNewPyVTKClass_AddPyvtkLocator_ClassNewPyType_ReadyPyVTKAddFile_vtkAbstractCellLocatorPyDict_SetItemString_Py_Dealloc_ZN13vtkPythonArgs8GetArrayEPdi_ZN13vtkPythonArgs8GetValueERxPyBool_FromLong_ZN13vtkPythonArgs8SetArrayEiPKdi_ZN22vtkAbstractCellLocator16InsideCellBoundsEPdxDW.ref.__gxx_personality_v0_ZN13vtkPythonArgs13ArgCountErrorEiPKc_ZN13vtkPythonArgs10GetArgSizeEi_ZN13vtkPythonArgs5ArrayIdEC1El_ZdaPvPyLong_FromLongLong_ZN13vtkPythonArgs8GetValueERd_ZN22vtkAbstractCellLocator8FindCellEPd_ZN22vtkAbstractCellLocator8FindCellEPddP14vtkGenericCellS0_S0__Unwind_Resume_ZN22vtkAbstractCellLocator18FindCellsAlongLineEPdS0_dP9vtkIdList_ZN22vtkAbstractCellLocator21FindCellsWithinBoundsEPdP9vtkIdList_ZN13vtkPythonArgs11SetArgValueEii_ZN13vtkPythonArgs11SetArgValueEid_ZN22vtkAbstractCellLocator28FindClosestPointWithinRadiusEPddS0_RxRiRd_ZN13vtkPythonArgs11SetArgValueEix_ZN22vtkAbstractCellLocator28FindClosestPointWithinRadiusEPddS0_P14vtkGenericCellRxRiRd_ZN22vtkAbstractCellLocator28FindClosestPointWithinRadiusEPddS0_P14vtkGenericCellRxRiRdS4__ZN22vtkAbstractCellLocator16FindClosestPointEPdS0_RxRiRd_ZN22vtkAbstractCellLocator16FindClosestPointEPdS0_P14vtkGenericCellRxRiRd_ZN22vtkAbstractCellLocator17IntersectWithLineEPKdS1_P9vtkPointsP9vtkIdList_ZN22vtkAbstractCellLocator17IntersectWithLineEPdS0_dRdS0_S0_Ri_ZN22vtkAbstractCellLocator17IntersectWithLineEPdS0_dRdS0_S0_RiRx_ZN22vtkAbstractCellLocator17IntersectWithLineEPdS0_dRdS0_S0_RiRxP14vtkGenericCellPyType_TypePyVTKObject_DeletePyVTKObject_ReprPyVTKObject_StringPyObject_GenericGetAttrPyObject_GenericSetAttrPyVTKObject_AsBufferPyVTKObject_TraversePyVTKObject_GetSetPyVTKObject_NewPyObject_GC_DelDPy}EzF{|{}G:ym}FH{I}JNyq{*l}K>yaz{*m}L.yQh{u*n}My1H{Um*pz}Ny({5M*rZ}Oy{-*t:}aPy{ *v}AQy { *. *uX } R y  E {Q *n *q } S yA [  { * *o } TZ y   { * *s }@ U y  *s { ***}PVy*q{*"*:}`Wy*s {*2*G}pXy*u{'*B*Z}Yy*q,{8*R*g}Zy!*o;{G*b*z}[y1*oL{X*r*}\y!A*u\{h**}]yA[{**k}$^y*~F H{)FIKWj}_y **w5xHFW{d|x{}BFCBB?NFY`y1Vg{{'6}aa&y;apy){bzF\!{ !{1!L!g!|!!!!{!!{"("{C"_"""}"cI#y#####d#z${$* %%{4%;%{V%`%}%e%%)&yE&&&&&&d&z'{'{'*''+(}(f((fS)yc)f)y)f#*y1*Q*q*****b*z+:+M+j+,{,{,{,{,-.-N-f-~--.{.{.{/9/N/n//b/z///#1{11{?1{M1{^1h1{11{1111{2"2{=2Z2w22}2{22{223 363M3e3{33g334g4y4g4y 5%595M5f56{6{6{667-7b87zX7u778{8{8{8{8*919X9n9{99{9999{::{+:K:w::::}:;h;y;h<y+<h3<s<h<y<hT=ya===== >$>D>d>>>D@{@{ A{ADAdA|AAAAABC{qD{D{DDDEE?EdEEEEbEzqG{ H{+HTHtHHiHzHdHz II{6I@I{^IhI{II{III}I{JJ5JNJXJ{vJJ{JJJ{JK#K-K{KKUK{pKK{"87(8#xF&H+9I>K*o*o*q*q*s*s*u*ujB5#<D0X8@2 (8x@HX`hpx8 ;  S(8h @dHpX `vhx ` xf0Q`  y(`8@H X `"h@x@ `@4P0Y: H(38"@+H@(Xp%`hp%x*"+@-h/ 4H\p     $Hh|4X|` @0 T` x   0@P0`Lphp80l5@:48=:)X"p%:18':K@(3:.symtab.strtab.shstrtab.rela.text.data.bss.text._ZN22vtkAbstractCellLocator23SetNumberOfCellsPerNodeEi.text._ZN22vtkAbstractCellLocator31GetNumberOfCellsPerNodeMinValueEv.text._ZN22vtkAbstractCellLocator31GetNumberOfCellsPerNodeMaxValueEv.text._ZN22vtkAbstractCellLocator23GetNumberOfCellsPerNodeEv.text._ZN22vtkAbstractCellLocator18SetCacheCellBoundsEi.text._ZN22vtkAbstractCellLocator18GetCacheCellBoundsEv.text._ZN22vtkAbstractCellLocator18SetRetainCellListsEi.text._ZN22vtkAbstractCellLocator18GetRetainCellListsEv.text._ZN22vtkAbstractCellLocator17SetLazyEvaluationEi.text._ZN22vtkAbstractCellLocator17GetLazyEvaluationEv.text._ZN22vtkAbstractCellLocator29SetUseExistingSearchStructureEi.text._ZN22vtkAbstractCellLocator29GetUseExistingSearchStructureEv.rela.text._ZNK22vtkAbstractCellLocator19NewInstanceInternalEv.rodata.str1.1.rodata._ZN22vtkAbstractCellLocator3IsAEPKc.str1.1.rela.text._ZN22vtkAbstractCellLocator3IsAEPKc.rela.text._ZN22vtkAbstractCellLocator17CacheCellBoundsOnEv.rela.text._ZN22vtkAbstractCellLocator18CacheCellBoundsOffEv.rela.text._ZN22vtkAbstractCellLocator17RetainCellListsOnEv.rela.text._ZN22vtkAbstractCellLocator18RetainCellListsOffEv.rela.text._ZN22vtkAbstractCellLocator16LazyEvaluationOnEv.rela.text._ZN22vtkAbstractCellLocator17LazyEvaluationOffEv.rela.text._ZN22vtkAbstractCellLocator28UseExistingSearchStructureOnEv.rela.text._ZN22vtkAbstractCellLocator29UseExistingSearchStructureOffEv.rodata.str1.8.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@QkHQlPQmXQn`QohQppQqxQrQsQtQuQv Qw Q~ Q Q Q Q Q Q Q  Q Q 0K@.Q&L,L1L!nM  M 0M5@Mm`MpMMMLMMMN  @Q(H2 NuW2~PPO@Q,P?@@Q.0Q<@XQ07pQ?2@pQ2sQ<n@Q4Q?@Q60R<@Q8'pR?"@Q:nR<i@Q<2R0@0Q?@0QAH@H`QCS@ @ QF @QH3.@QJ_0,hx 8@QO0Rk 8z