ELF>M@@ UH@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=tHATUHHVdH%(HD$81HH4$HD$HGfnfnȉD$fbfD$uAHo(Htt[H1HT$8dH+%(uzHH]A\HtHh(Ht̋D$tUH1뺐Ld$ HLtHEHLHHuHvT$Off.@ATUHHVdH%(HD$81HH4$HD$HGfnfnȉD$fbfD$uAHo(Htt[H1HT$8dH+%(uzHH]A\HtHh(Ht̋D$tUH1뺐Ld$ HLtHEHLHHuHvT$Off.@AUATUHPVdH%(HD$H1HHt$HD$HGfnfnȉD$(fbfD$ uFHo(HtthH|$1HT$HdH+%(HP]A\A]@HtHh(HtɋD$$|H|$1Ld$Ht$LtLl$0LLyHEHt$LHHVHHHT$ ff.AVAUATUHXVdH%(HD$H1HHt$HD$HGfnfnȉD$(fbfD$ uDHo(HttfH|$1HT$HdH+%(HX]A\A]A^HtHh(HtˋD$$H|$1Ll$0Ld$LLtLt$LLxHEHLLHtHKHc@HT$LT$ ff.ATH0fnFdH%(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=tLfDHЉfAT1UHhHVdH%(HD$X1HGAfnAH%fnA)fbAtaAHHt$ HT$(L$8fD$0HHo(HtwAXH|$ 1WLHt$ LT$(T$0L$4L$8HHo(HtAH|$ 1HT$XdH+%(NHh]A\DH5D1DHtHh(HtT$4H|$ 1HtHh(H~D$4uDL$0NLd$@H|$ LFHEHLHH%HLd$ Ht$LHt$LHt$LHEHT$L$D$HHwDL$0AW1AVAUATUHpHVdH%(HD$h1HGAfnAH%fnA)fbAtCAH5D1HT$hdH+%(Hp]A\A]A^A_fDLHt$LT$T$ L$$L$(HHo(HtpAOH|$1HHt$HT$L$(fD$ Hu`Ho(HtAuH|$12fHtHh(HtT$$:H|$1HtHh(HtD$$uDL$ Ll$Ld$LH5L|$IuL|$0LLXLLEHEHHL$LLHtq1SLl$HT$H5L|$ILt$0LLHEHLLHHcDL$ $ff.fATL%1HH5LuLHLA\ATIUHHt HH5LHtHmtH]A\HH]A\SafeDownCastvtkObjectBasevtkIncrementalPointLocatorIsTypeOfFindClosestInsertedPointInsertNextPointInsertPointInsertUniquePointNewInstanceIsAIsInsertedPointInitPointInsertionvtkPointsvtkAbstractPointLocatorvtkLocatorvtkObjectUH=Hu]ÐHH=tHH=tHH=tH]vtkIncrementalPointLocator - Abstract class in support of both point location and point insertion. Superclass: vtkAbstractPointLocator Compared to a static point locator for 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. There are two incremental point locators, i.e., vtkPointLocator and vtkIncrementalOctreePointLocator. As opposed to the uniform bin-based search structure (adopted in vtkPointLocator) with a fixed spatial resolution, an octree mechanism (employed in vtkIncrementalOctreePointlocator) resorts to 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 point insertion, particularly when handling a radically imbalanced layout of points as not uncommon in datasets defined on adaptive meshes. In other words, vtkIncrementalOctreePointLocator is an octree-based accelerated implementation of all functionalities of vtkPointLocator. @sa vtkLocator, vtkIncrementalOctreePointLocator, vtkPointLocator, vtkMergePoints vtkStaticPointLocator vtkCommonDataModelPython.vtkIncrementalPointLocatorV.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) -> vtkIncrementalPointLocator C++: static vtkIncrementalPointLocator *SafeDownCast( vtkObjectBase *o) Standard type and print methods. V.NewInstance() -> vtkIncrementalPointLocator C++: vtkIncrementalPointLocator *NewInstance() Standard type and print methods. V.FindClosestInsertedPoint((float, float, float)) -> int C++: virtual vtkIdType FindClosestInsertedPoint(const double x[3]) Given a point x assumed to be covered by the search structure, return the index of the closest point (already inserted to the search structure) 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.InitPointInsertion(vtkPoints, (float, float, float, float, float, float)) -> int C++: virtual int InitPointInsertion(vtkPoints *newPts, const double bounds[6]) V.InitPointInsertion(vtkPoints, (float, float, float, float, float, float), int) -> int C++: virtual int InitPointInsertion(vtkPoints *newPts, const double bounds[6], vtkIdType estSize) Initialize the point insertion process. newPts is an object, storing 3D point coordinates, to which incremental point insertion puts coordinates. It is created and provided by an external VTK class. Argument bounds represents the spatial bounding box, into which the points fall. V.IsInsertedPoint(float, float, float) -> int C++: virtual vtkIdType IsInsertedPoint(double x, double y, double z) V.IsInsertedPoint((float, float, float)) -> int C++: virtual vtkIdType IsInsertedPoint(const double x[3]) Determine whether or not a given point has been inserted. Return the id of the already inserted point if true, else return -1. InitPointInsertion() should have been called in advance. V.InsertUniquePoint((float, float, float), int) -> int C++: virtual int InsertUniquePoint(const double x[3], vtkIdType &ptId) Insert a point unless there has been a duplciate in the search structure. This method is not thread safe. V.InsertPoint(int, (float, float, float)) C++: virtual void InsertPoint(vtkIdType ptId, const double x[3]) Insert a given point with a specified point index ptId. InitPointInsertion() should have been called prior to this function. Also, IsInsertedPoint() should have been called in advance to ensure that the given point has not been inserted unless point duplication is allowed. V.InsertNextPoint((float, float, float)) -> int C++: virtual vtkIdType InsertNextPoint(const double x[3]) Insert a given point and return the point index. InitPointInsertion() should have been called prior to this function. Also, IsInsertedPoint() should have been called in advance to ensure that the given point has not been inserted unless point duplication is allowed. HHHDGCC: (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0GNUzRx  0EDPa AE TbEY B }(tEAD`n AAF (FAD` ABH (FAD` ABH 0DFBA Dp  ABBE 8,bFBB A(D (A BBBA hgFD@ EE 0FAA D`  AABH ,pFCD  ABF @FDB B(A0Du 0A(B BBBG 4HFA0POFDD n ABA DDB  <s0D2brg` p` ]`     6   # ?  X h t  & , 2 8 >" v$5" b]d0Dcy-HSb`O 6Ncx_ZL41PyvtkIncrementalPointLocator_SafeDownCastP7_objectS0__ZL37PyvtkIncrementalPointLocator_IsTypeOfP7_objectS0__ZL53PyvtkIncrementalPointLocator_FindClosestInsertedPointP7_objectS0__ZL44PyvtkIncrementalPointLocator_InsertNextPointP7_objectS0__ZL40PyvtkIncrementalPointLocator_InsertPointP7_objectS0__ZL46PyvtkIncrementalPointLocator_InsertUniquePointP7_objectS0__ZL40PyvtkIncrementalPointLocator_NewInstanceP7_objectS0__ZL32PyvtkIncrementalPointLocator_IsAP7_objectS0__ZL44PyvtkIncrementalPointLocator_IsInsertedPointP7_objectS0__ZL47PyvtkIncrementalPointLocator_InitPointInsertionP7_objectS0__ZL33PyvtkIncrementalPointLocator_Type_ZL36PyvtkIncrementalPointLocator_Methods_GLOBAL__sub_I_vtkIncrementalPointLocatorPython.cxx.LC0.LC1.LC2.LC6.LC3.LC4.LC5.LC7.LC8.LC9.LC10.LC11.LC12.LC13.LC14.LC15.LC16_ZNK26vtkIncrementalPointLocator19NewInstanceInternalEv_ZN9vtkObject3NewEv_ZN13vtkPythonArgs13ArgCountErrorEii_ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRbPyErr_Occurred_ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__stack_chk_fail_ZN26vtkIncrementalPointLocator3IsAEPKcstrcmp_ZN13vtkObjectBase8IsTypeOfEPKc_ZN13vtkPythonArgs8GetValueERPcPyLong_FromLong_ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1__ZN13vtkPythonArgs16PureVirtualErrorEv_ZN13vtkPythonArgs8GetArrayEPdiPyLong_FromLongLong_ZN13vtkPythonArgs8GetValueERx_GLOBAL_OFFSET_TABLE__Py_NoneStruct_ZN13vtkPythonArgs11SetArgValueEixPyVTKObject_CheckPyVTKObject_GetObjectPyVTKObject_SetFlag_ZN13vtkPythonArgs13ArgCountErrorEiPKc_ZN13vtkPythonArgs8GetValueERdPyvtkIncrementalPointLocator_ClassNewPyVTKClass_AddPyvtkAbstractPointLocator_ClassNewPyType_ReadyPyVTKAddFile_vtkIncrementalPointLocatorPyDict_SetItemString_Py_DeallocPyType_TypePyVTKObject_DeletePyVTKObject_ReprPyVTKObject_StringPyObject_GenericGetAttrPyObject_GenericSetAttrPyVTKObject_AsBufferPyVTKObject_TraversePyVTKObject_GetSetPyVTKObject_NewPyObject_GC_DelP*}+,-,.:*m2}00,3001.c*456,7.1*456, 7.S *458'6I,Y*:g.!*!4E5f6z8,,3;."_*4*(),-<=%>4,S.#* 4+ 2N */[ ` 0n s 0| , 3  0  0 1 .L $ * $ * $ ?) 4M 5Y 4 6 , 7 @ @ @? ,R . % ? %A *S % * 4 5 4&+36F8m,&+6,3.")1B7?CINDoA~FG)0&+09>0LQ0^1'H0IXJKLMNOP8Q@R6P (`8@HX0`hx?``    t h0 X(8 4Xx00l` ` 8T`.symtab.strtab.shstrtab.rela.text.data.bss.rela.text._ZNK26vtkIncrementalPointLocator19NewInstanceInternalEv.rodata.str1.1.rodata._ZN26vtkIncrementalPointLocator3IsAEPKc.str1.1.rela.text._ZN26vtkIncrementalPointLocator3IsAEPKc.rodata.str1.8.rela.text.startup.rela.init_array.rela.data.rel.rela.data.rel.local.comment.note.GNU-stack.note.gnu.property.rela.eh_frame.group@ (L / `@8 &,6 1@Et22-b@E 2x#@F0(#@F%@# @F 4$` /@HD0@&,Ml&]p& u&p@Jh()( 08L