ELF>@@,+  "#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+%(utHH[]fHt$H|$tHl$H=HtHH=uHuHc@HH8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>H(HtD$9D$t;H111HT$(dH+%(u9H8HHuҐHuHHff.@SH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=HG(HtL$9L$t:H111HT$(dH+%(u=H0[fDHHuӐHHu1H@f.UH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(u^H0]fDHHuӐt$Ho8HuHHHH;tHfUH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(u^H0]fDHHuӐt$HoPHuHHHH;tHfSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uUH0[fDHHuӐt_0HuHcDHHH;tЉfUH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uVH0]fDHHuӐtHHuH뵐HHH;tHUH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=HG(HtT$9T$t:H111HT$(dH+%(uVH0]fDHHuӐH0HHPHDHHuHH5HUH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=HG(HtT$9T$t:H111HT$(dH+%(uSH0]fDHHuӐH0HPhH8HDHHuHH5H@UH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(u_H@]f.HHuϐH5HT$H|$|$HtHHuHHff.USHHfnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uKH_(Ht!D$ +D$$tEH|$1HT$8dH+%(uVHH[]HHuАHt$ H|$tHcT$ HH,HuH@AUATUHPfnFdH%(HD$H1HHt$HD$HGfnȉD$(fbfD$ uPHo(Ht!D$ +D$$tRH|$1HT$HdH+%(HP]A\A]fDHHufLl$0Ld$LLtHT$H5L|$HtHLfH~HhfHn[fAWAVSH`fnFdH%(HD$X1HHt$ HD$(HGfnȉD$8fbfD$0uPH_(Ht!D$0+D$4tRH|$ 1HT$XdH+%(H`[A^A_fDHHufHt$@H|$ tHT$@d$HH\$PHfI~fI~XPhXp`\$l$t$HVfIn1f/|$fIn1f/|$fHnP1f/|$D$(f/C@v1KXf/r&D$0f/CHvK`1f/@ 1HLHAff.USHHfnFdH%(HD$81HH4$HD$HGfnЉD$fbfD$uLH_(HtD$+D$tFH1HT$8dH+%(HH[]HHu͐Ht$ HtKhD$ f/rQf/rCD$(f/Cpr6f/r(D$0f/Cxr1f/@ 1HDH9fDATH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$uDH(HtD$9D$tIH11E1HD$(dH+%(H0LA\@HHufHHRxH;IMtoI$H5LPtZHuLIHoHbL1HHP@L8fE1H"DIjfATUHhfnFdH%(HD$X1HHt$0HD$8HGfnD$HfbfD$@uJHo(Ht!D$@+D$DtDH|$01HT$XdH+%(Hh]A\fHHuѐLd$0HLtHt$LtHt$LtHt$LtHt$ LtHt$(L_l$(d$ H\$T$L$$H&HHAVAUATUSHpfnFdH%(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~TIEH9AD$D1HDAoTHH9uDAt ITHLLLE~*Ic1DHH9tH I9LtHt'H|$0E1HL%I$pDL1HfD1ITHHH9ubHAWAVAUATUSHfnFdH%(H$1HHt$ HD$(HGfnȉD$8fbfD$0Hl$ Lw(1HH|$`4AHcLl$`EutMD$0+D$4HH|$`E1HtHD$hH9tH$dH+%(HĨL[]A\A]A^A_IcI\fDHH6H|$ E1H|$`4HcH|$`IkLE1`HT$H5H|$HD$4L|$@HLHt$HDLHHt$HE~SIEH9AD$D1H@AoTHH9uDAt ITHDL$L$MLHt$LAE~)Ic1 @HH9tH I9LtHtAH$IcH|$`ID1fITHHH9urDLHHAW1AVAUATUSHHNdH%(H$1HGAfnH%fnA)fbAtGAH5D1H$dH+%(HĘ[]A\A]A^A_HHt$0H\$8L$@T$DT$HH:Ho(HD$@+D$D|H|$01uHHt$0H\$8T$HfD$@HHo(Ht%D$@+D$DH|$01Ll$pLd$0LLtL|$,H5LL|$,ItLLtL$,LLHfH~HufHnfLl$PLd$0LLPLt$pLL3H\$,H5LH|$,IHLf(L$pHLLDD$,LH$fL$) $f( $f.L$pfH~}u{\$f.\$xzmukfHnf.$z[uYHfHn@HH31|HH1\HuLLfATL%H HH5LuLHLA\ATIUHHt HH5LHtHmtH]A\HH]A\G0HHG8HGPSafeDownCastvtkObjectBasevtkIncrementalOctreeNodeIsTypeOfDeleteChildNodesIsLeafGetMinBoundsGetMaxBoundsGetNumberOfPointsGetPointIdSetGetMaxDataBoundsp_voidGetMinDataBoundsExportAllPointIdsByInsertionvtkIdListGetChildGetDistance2ToInnerBoundaryGetChildIndexGetBoundsIsAContainsPointContainsPointByDataNewInstanceSetBoundsExportAllPointIdsByDirectSetInsertPointvtkPointsGetDistance2ToBoundaryvtkObjectUH=Hu]ÐHH=tH]H|$0HD$8H9t HtHH|$`HD$hH9t HtHo2z5vtkIncrementalOctreeNode - Octree node constituting incremental octree (in support of both point location and point insertion) Superclass: vtkObject Octree nodes serve as spatial sub-division primitives to build the search structure of an incremental octree in a recursive top-down manner. The hierarchy takes the form of a tree-like representation by which a parent node contains eight mutually non-overlapping child nodes. Each child is assigned with an axis-aligned rectangular volume (Spatial Bounding Box) and the eight children together cover exactly the same region as governed by their parent. The eight child nodes / octants are ordered as { (xBBoxMin, xBBoxMid] & (yBBoxMin, yBBoxMid] & (zBBoxMin, zBBoxMid] }, { (xBBoxMid, xBBoxMax] & (yBBoxMin, yBBoxMid] & (zBBoxMin, zBBoxMid] }, { (xBBoxMin, xBBoxMid] & (yBBoxMid, yBBoxMax] & (zBBoxMin, zBBoxMid] }, { (xBBoxMid, xBBoxMax] & (yBBoxMid, yBBoxMax] & (zBBoxMin, zBBoxMid] }, { (xBBoxMin, xBBoxMid] & (yBBoxMin, yBBoxMid] & (zBBoxMid, zBBoxMax] }, { (xBBoxMid, xBBoxMax] & (yBBoxMin, yBBoxMid] & (zBBoxMid, zBBoxMax] }, { (xBBoxMin, xBBoxMid] & (yBBoxMid, yBBoxMax] & (zBBoxMid, zBBoxMax] }, { (xBBoxMid, xBBoxMax] & (yBBoxMid, yBBoxMax] & (zBBoxMid, zBBoxMax] }, where { xrange & yRange & zRange } defines the region of each 3D octant. In addition, the points falling within and registered, by means of point indices, in the parent node are distributed to the child nodes for delegated maintenance. In fact, only leaf nodes, i.e., those without any descendants, actually store point indices while each node, regardless of a leaf or non- leaf node, keeps a dynamically updated Data Bounding Box of the inhabitant points, if any. Given a maximum number of points per leaf node, an octree is initialized with an empty leaf node that is then recursively sub-divided, but only on demand as points are incrementally inserted, to construct a populated tree. Please note that this octree node class is able to handle a large number of EXACTLY duplicate points that is greater than the specified maximum number of points per leaf node. In other words, as an exception, a leaf node may maintain an arbitrary number of exactly duplicate points to deal with possible extreme cases. @sa vtkIncrementalOctreePointLocator vtkCommonDataModelPython.vtkIncrementalOctreeNodeV.IsTypeOf(string) -> 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. V.IsA(string) -> 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. V.SafeDownCast(vtkObjectBase) -> vtkIncrementalOctreeNode C++: static vtkIncrementalOctreeNode *SafeDownCast( vtkObjectBase *o) V.NewInstance() -> vtkIncrementalOctreeNode C++: vtkIncrementalOctreeNode *NewInstance() V.GetNumberOfPoints() -> int C++: virtual int GetNumberOfPoints() Get the number of points inside or under this node. V.GetPointIdSet() -> vtkIdList C++: virtual vtkIdList *GetPointIdSet() Get the list of point indices, nullptr for a non-leaf node. V.DeleteChildNodes() C++: void DeleteChildNodes() Delete the eight child nodes. V.SetBounds(float, float, float, float, float, float) C++: void SetBounds(double x1, double x2, double y1, double y2, double z1, double z2) Set the spatial bounding box of the node. This function sets a default data bounding box. V.GetBounds([float, float, float, float, float, float]) C++: void GetBounds(double bounds[6]) Get the spatial bounding box of the node. The values are returned via an array in order of: x_min, x_max, y_min, y_max, z_min, z_max. V.GetMinBounds() -> (float, float, float) C++: double *GetMinBounds() V.GetMaxBounds() -> (float, float, float) C++: double *GetMaxBounds() V.GetMinDataBounds() -> (float, ...) C++: double *GetMinDataBounds() Get access to MinDataBounds. Note that MinDataBounds is not valid until point insertion. V.GetMaxDataBounds() -> (float, ...) C++: double *GetMaxDataBounds() Get access to MaxDataBounds. Note that MaxDataBounds is not valid until point insertion. V.IsLeaf() -> int C++: int IsLeaf() Determine whether or not this node is a leaf. V.GetChildIndex((float, float, float)) -> int C++: int GetChildIndex(const double point[3]) Determine which specific child / octant contains a given point. Note that the point is assumed to be inside this node and no checking is performed on the inside issue. V.GetChild(int) -> vtkIncrementalOctreeNode C++: vtkIncrementalOctreeNode *GetChild(int i) Get quick access to a child of this node. Note that this node is assumed to be a non-leaf one and no checking is performed on the node type. V.ContainsPoint((float, float, float)) -> int C++: int ContainsPoint(const double pnt[3]) A point is in a node if and only if MinBounds[i] < p[i] <= MaxBounds[i], which allows a node to be divided into eight non-overlapping children. V.ContainsPointByData((float, float, float)) -> int C++: int ContainsPointByData(const double pnt[3]) A point is in a node, in terms of data, if and only if MinDataBounds[i] <= p[i] <= MaxDataBounds[i]. V.InsertPoint(vtkPoints, (float, float, float), int, [int, ...], int) -> int C++: int InsertPoint(vtkPoints *points, const double newPnt[3], int maxPts, vtkIdType *pntId, int ptMode) This function is called after a successful point-insertion check and only applies to a leaf node. Prior to a call to this function, the octree should have been retrieved top-down to find the specific leaf node in which this new point (newPt) will be inserted. The actual index of the new point (to be inserted to points) is stored in pntId. Argument ptMode specifies whether the point is not inserted at all but instead only the point index is provided upon 0, the point is inserted via vtkPoints:: InsertPoint() upon 1, or it is inserted via vtkPoints::InsertNextPoint() upon 2. For case 0, pntId needs to be specified. For cases 1 and 2, the actual point index is returned via pntId. Note that this function always returns 1 to indicate the success of point insertion. V.GetDistance2ToInnerBoundary((float, float, float), vtkIncrementalOctreeNode) -> float C++: double GetDistance2ToInnerBoundary(const double point[3], vtkIncrementalOctreeNode *rootNode) Given a point inside this node, get the minimum squared distance to all inner boundaries. An inner boundary is a node's face that is shared by another non-root node. V.GetDistance2ToBoundary((float, float, float), vtkIncrementalOctreeNode, int) -> float C++: double GetDistance2ToBoundary(const double point[3], vtkIncrementalOctreeNode *rootNode, int checkData) V.GetDistance2ToBoundary((float, float, float), [float, float, float], vtkIncrementalOctreeNode, int) -> float C++: double GetDistance2ToBoundary(const double point[3], double closest[3], vtkIncrementalOctreeNode *rootNode, int checkData) Compute the minimum squared distance from a point to this node, with all six boundaries considered. The data bounding box is checked if checkData is non-zero. V.ExportAllPointIdsByInsertion(vtkIdList) C++: void ExportAllPointIdsByInsertion(vtkIdList *idList) Export all the indices of the points (contained in or under this node) by inserting them to an allocated vtkIdList via vtkIdList::InsertNextId(). V.ExportAllPointIdsByDirectSet([int, ...], vtkIdList) C++: void ExportAllPointIdsByDirectSet(vtkIdType *pntIdx, vtkIdList *idList) Export all the indices of the points (contained in or under this node) by directly setting them in an allocated vtkIdList object. pntIdx indicates the starting location (in terms of vtkIdList) from which new point indices are added to vtkIdList by vtkIdList::SetId(). HHHDGCC: (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0GNUzRx 0 D X l  EDPa AE <EY B W(EAD`j AAJ H@ I ED@ AG DED@ AG hED@ AG ED@ AG ED@ AG ED@ AG ED@ AG EDP AK (@EAD` AAI 0l.FBA Dp  ABBG 0tFBA D  ABBG 0FBA G  ABBF 0^FAA D`  AABH (<BEAD` AAH (hJEAD` AAH gFD@ EE (oFAD ABC zPLRx D$FBB A(A0D 0D(A BBBD l!LFBB B(A0A8G 8D0A(B BBBA !H>FDB B(A0A8G{ 8A0A(B BBBD 0MFF0LOFDD n ABA DDBg   ,e Cp|`@ 1n  .4 tn @^BJN@go !S!!> 0 X  4=NUbo . BNXu"(.4" g" " " " Lq"< $ D d t     $ M b    + > j       !"2 S s z      S z   M+@MPOs1DT_ZL36PyvtkIncrementalOctreeNode_StaticNewv_ZL39PyvtkIncrementalOctreeNode_SafeDownCastP7_objectS0__ZL35PyvtkIncrementalOctreeNode_IsTypeOfP7_objectS0__ZL43PyvtkIncrementalOctreeNode_DeleteChildNodesP7_objectS0__ZL33PyvtkIncrementalOctreeNode_IsLeafP7_objectS0__ZL39PyvtkIncrementalOctreeNode_GetMinBoundsP7_objectS0__ZL39PyvtkIncrementalOctreeNode_GetMaxBoundsP7_objectS0__ZL44PyvtkIncrementalOctreeNode_GetNumberOfPointsP7_objectS0__ZL40PyvtkIncrementalOctreeNode_GetPointIdSetP7_objectS0__ZL43PyvtkIncrementalOctreeNode_GetMaxDataBoundsP7_objectS0__ZL43PyvtkIncrementalOctreeNode_GetMinDataBoundsP7_objectS0__ZL55PyvtkIncrementalOctreeNode_ExportAllPointIdsByInsertionP7_objectS0__ZL35PyvtkIncrementalOctreeNode_GetChildP7_objectS0__ZL54PyvtkIncrementalOctreeNode_GetDistance2ToInnerBoundaryP7_objectS0__ZL40PyvtkIncrementalOctreeNode_GetChildIndexP7_objectS0__ZL36PyvtkIncrementalOctreeNode_GetBoundsP7_objectS0__ZL30PyvtkIncrementalOctreeNode_IsAP7_objectS0__ZL40PyvtkIncrementalOctreeNode_ContainsPointP7_objectS0__ZL46PyvtkIncrementalOctreeNode_ContainsPointByDataP7_objectS0__ZL38PyvtkIncrementalOctreeNode_NewInstanceP7_objectS0__ZL36PyvtkIncrementalOctreeNode_SetBoundsP7_objectS0__ZL55PyvtkIncrementalOctreeNode_ExportAllPointIdsByDirectSetP7_objectS0__ZL55PyvtkIncrementalOctreeNode_ExportAllPointIdsByDirectSetP7_objectS0_.cold_ZL38PyvtkIncrementalOctreeNode_InsertPointP7_objectS0__ZL38PyvtkIncrementalOctreeNode_InsertPointP7_objectS0_.cold_ZL49PyvtkIncrementalOctreeNode_GetDistance2ToBoundaryP7_objectS0__ZL31PyvtkIncrementalOctreeNode_Type_ZL34PyvtkIncrementalOctreeNode_Methods_GLOBAL__sub_I_vtkIncrementalOctreeNodePython.cxx.LC0.LC1.LC2.LC4.LC3.LC5.LC6.LC7.LC8.LC9.LC10.LC11.LC12.LC13.LC14.LC15.LC16.LC17.LC18.LC19.LC20.LC21.LC22.LC23.LC24.LC25.LC27.LC28.LC30.LC31_ZN24vtkIncrementalOctreeNode17GetNumberOfPointsEv_ZN24vtkIncrementalOctreeNode13GetPointIdSetEv_ZN24vtkIncrementalOctreeNode12GetMinBoundsEv_ZN24vtkIncrementalOctreeNode12GetMaxBoundsEv_ZN24vtkIncrementalOctreeNode3NewEv_ZNK24vtkIncrementalOctreeNode19NewInstanceInternalEv_ZN13vtkPythonArgs13ArgCountErrorEii_ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRbPyErr_Occurred_ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__stack_chk_fail_ZN24vtkIncrementalOctreeNode3IsAEPKcstrcmp_ZN13vtkObjectBase8IsTypeOfEPKc_ZN13vtkPythonArgs8GetValueERPcPyLong_FromLong_ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1__ZN24vtkIncrementalOctreeNode16DeleteChildNodesEv_GLOBAL_OFFSET_TABLE__Py_NoneStruct_ZN13vtkPythonArgs10BuildTupleEPKdi_ZN13vtkPythonUtil13ManglePointerEPKvPKcPyUnicode_FromString_ZN24vtkIncrementalOctreeNode28ExportAllPointIdsByInsertionEP9vtkIdList_ZN13vtkPythonArgs8GetValueERi_ZN13vtkPythonArgs8GetArrayEPdi_ZN24vtkIncrementalOctreeNode27GetDistance2ToInnerBoundaryEPKdPS_PyFloat_FromDouble_ZNK24vtkIncrementalOctreeNode9GetBoundsEPd_ZN13vtkPythonArgs8SetArrayEiPKdiPyVTKObject_CheckPyVTKObject_GetObjectPyVTKObject_SetFlag_ZN13vtkPythonArgs8GetValueERd_ZN24vtkIncrementalOctreeNode9SetBoundsEddddddDW.ref.__gxx_personality_v0_ZN13vtkPythonArgs10GetArgSizeEi_ZN13vtkPythonArgs5ArrayIxEC1El_ZdaPv_ZN13vtkPythonArgs8GetArrayEPxi_ZN24vtkIncrementalOctreeNode28ExportAllPointIdsByDirectSetEPxP9vtkIdList_ZN13vtkPythonArgs8SetArrayEiPKxi_Unwind_Resume_ZN24vtkIncrementalOctreeNode11InsertPointEP9vtkPointsPKdiPxi_ZN13vtkPythonArgs13ArgCountErrorEiPKc_ZN24vtkIncrementalOctreeNode22GetDistance2ToBoundaryEPKdPS_i_ZN24vtkIncrementalOctreeNode22GetDistance2ToBoundaryEPKdPdPS_iPyvtkIncrementalOctreeNode_ClassNewPyVTKClass_AddPyvtkObject_ClassNewPyType_ReadyPyVTKAddFile_vtkIncrementalOctreeNodePyDict_SetItemString_Py_DeallocPyType_TypePyVTKObject_DeletePyVTKObject_ReprPyVTKObject_StringPyObject_GenericGetAttrPyObject_GenericSetAttrPyVTKObject_AsBufferPyVTKObject_TraversePyVTKObject_GetSetPyVTKObject_NewPyObject_GC_Del,-`Q.R/STSU 0JQ}Y/W1WSZXU2MQq[\S*^U3QA[XSkZrU4Q[)S;_U*McU5Q[S+_E*NSU6Q[SZ-*K:Ua7Q[ST *LUA8Q[S9`aU!:nQ[S9`aU ;Z Q [ < R b S *^ U =[ Q [ c S T U >N Qy [ d / R e S f U% ?~ Q [ d Sf Zp U @Q1[TdgS*^S(h/UdAQ[ Y.*V7/<WJ1OWXSiZXUBQA[^dSZUChQ[dS,Z6UbDQ[*PO/'S4THiXjukSUE,QQ[ll}lllllmS *^UHFopQq1[Lo^pr<RsESOSg*^tUG;oNpQq[op8H@Redzcrc!wMSWShZtU&I.xcIQIQ6dF/QRfc|ySfdd/R cAzSf[[ShU +/,&|,+4}>+C~_{n/yOO/W&1+W8Xqv6q>vJ+)( 0X8@ 4(@  (@8(H @ HX(@ ` Bh@x(  o`((  @(  =((  N(   (p  U(8(X@ bHpX(` hx(  ( N((  (  ( (x  .(8(h@ uHX(8` h x( (p ( X (u 4H\p $Hlp`@  D p   @@l@n !PY!t}!"!!<4PP).symtab.strtab.shstrtab.rela.text.data.bss.text._ZN24vtkIncrementalOctreeNode17GetNumberOfPointsEv.text._ZN24vtkIncrementalOctreeNode13GetPointIdSetEv.text._ZN24vtkIncrementalOctreeNode12GetMinBoundsEv.text._ZN24vtkIncrementalOctreeNode12GetMaxBoundsEv.rela.text._ZNK24vtkIncrementalOctreeNode19NewInstanceInternalEv.rodata.str1.1.rodata._ZN24vtkIncrementalOctreeNode3IsAEPKc.str1.1.rela.text._ZN24vtkIncrementalOctreeNode3IsAEPKc.rela.text.unlikely.gcc_except_table.rodata.str1.8.rela.text.startup.rela.init_array.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@)KH)LP)MX)N` )Pl )Vx )n @i)&/ ,/ 10 j@ P `  p @P)H2y W2" 0"<@hx)l"B@`)"D2"mpB@@0) B@p)B @ )*@D %@x) ?@G:@ )"k0HG,ttGxG G@8)'(M8 *K `Zd