ELF>hf@@:9 !")*01UH@dH%(HD$81HHt$HD$HFHD$$D$ t0H|$1HT$8dH+%(uhH@]@HT$H|$H5|$HtHt+HH5HPtHuH1Huff.fUH@dH%(HD$81HHt$HD$HFHD$$D$ t0H|$1HT$8dH+%(uFH@]@H|$HT$H5|$HtHHuHff.@ATUHHdH%(HD$81HHt$HD$HFHD$$D$ D$ wcLd$HT$ H5L|$ Ht#D$ 9D$(|Vt$ HHHtU1HT$8dH+%(uMHH]A\H|$f.Ht$ LuDHfHtSHo[1ff.fATUH-HHdH%(HD$81HFHt$Hl$D$ HD$$HD$tUH|$E1H|$HtH/tHD$8dH+%(u[HHL]A\fHT$H|$HIHtAo$HHIff.UH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHoHt!D$ +D$$tFH|$1HT$8dH+%(u_H@]f.HHuϐH5HT$H|$|$HtHHuHHff.UHHHtH]UH0dH%(HD$(1HH4$HD$HFHD$D$t*H111HT$(dH+%(u-H0]fDHI1MuHfUH0dH%(HD$(1HH4$HD$HFHD$D$t*H111HT$(dH+%(u-H0]fDHI1MuHfUH0dH%(HD$(1HH4$HD$HFHD$D$t*H111HT$(dH+%(u-H0]fDHI1MuHfATUHHHt HHupHEDžt6tH5H1]A\HH1]A\HHHHH=]A\DHH5H8Iff.USHHdH%(HD$81HHt$HD$HFHD$$D$ HD$t6H|$1HT$8dH+%(HH[]DHt$H|$tHl$H=HtHH=uHuHc@HH=tHH=tHSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=HGHtL$9L$t:H111HT$(dH+%(u3H0[fDHHuӐXHuHc@SH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=HGHtL$9L$t:H111HT$(dH+%(u4H0[fDHHuӐXHuUH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=HGHtL$9L$t:H111HT$(dH+%(u3H0]fDHHuӐH(HuH@H8fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u>HHtD$9D$t;H111HT$(dH+%(u9H8HHuҐHuHHff.@SH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=HHtD$9D$t:H111HT$(dH+%(u7H0[fDHHuӐHuUH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHoHt!D$ +D$$tFH|$1HT$8dH+%(uVH@]f.HHuϐHt$ H|$tt$ HHuHHDUH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(u8H0]fDHHuӐHHuHff.@SH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(u7H0[fDHHuӐHuHcUH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(u8H0]fDHHuӐHHuHff.@UH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(u8H0]fDHHuӐHHuHff.@UH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(u8H0]fDHHuӐHHuHff.@UH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(u^H0]fDHHuӐt$HHuH@HHXH;tHfUH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(u^H0]fDHHuӐt$HHuH@HH0H;tHfSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uUH0[fDHHuӐtHuHcfHHxH;tЉfUH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(uVH@]f.HHuϐHt$ H|$tt$ HHuHHDUH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(uVH@]f.HHuϐHt$ H|$tt$ HHuHHDUH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(u_H@]f.HHuϐH5HT$H|$|$HtHHuHHff.UH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(u_H@]f.HHuϐH5HT$H|$|$HtHHuHHff.UH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(uVH@]f.HHuϐHt$ H|$tt$ HHHuHDUH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(uVH@]f.HHuϐHt$ H|$tt$ HHHuHDUH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(uVH@]f.HHuϐHt$ H|$tt$ HHHuHDAVAUATUHHfnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ Ho(Ht!D$ +D$$tH(HtD$9D$t;H111HT$(dH+%(uLH8HHuҐu$HHuHH@ff.U1IHAWAVAUATSH(fnFdH%(HEHG~H%fn)fbƒt< H51HUdH+%(\ He[A\A]A^A_]H H0H8Hfօ@HDH0Mx(1HHH}4AHcLeE,MB@+D.HH}1HUH9(HHH@H H0H8Hfօ@HH0Mx(1HHH}4AHcLeEuhM@+DrHH}1HXHUH9,FIcI@IcILPHLHHH5HHH |HH(aHHHHHIc1 HH9t$Af.ztHHHqLH}f@LIHH0H}4HcH}1IL1LIHH0H}4HcH}1IL1H}HL1bHHHATLLLHHHD1@AHH9uH!HHDL-H4HL1APLLLLHATHAHHHD1AHH9uHHDLHeHHDAVAUATUSHPfnFdH%(HD$H1HHt$HD$HGfnȉD$(fbfD$ uUHo(Ht!D$ +D$$tOH|$1HT$HdH+%( HP[]A\A]A^HHuƐLd$0Ll$LLtT$8\$@D$$D$0fH~fI~ޅufHED$HLD$Hf.D$0z_u]fHnf.d$8zPuNfInf.l$@zAu?H.H#@HLD$D$H@HuL1LDAWAVAUATUH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ Ho(Ht!D$ +D$$t:H|$1HT$8dH+%(H@]A\A]A^A_fLl$Ht$LtL|$L5LLL|$ItLLL|$HtD$$Ht$uQLELHAH\HHNfHH4f.LHff.ATUHHfnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uJHo(Ht!D$ +D$$tDH|$1HT$8dH+%(HH]A\fHHuѐLd$Ht$LtHT$H5L|$HtD$$Ht$u/HEHHtHHf@HAV1IAUATUHfnFdH%(HD$xHG~H%fn)fbtAH5E1HD$xdH+%(HĈL]A\A]A^H Ht$ HL$(T$8fD$0H Ih(Ht%D$0+D$4rH|$ E1}fDH Ht$ HL$(T$8fD$0HHl$ M`(HH|$@4AHcH|$@H|$Mt'D$0+D$4t?HH|$@E1HHD$HH9@Ht$HtLt$HLtHt$DHtD$4Ht$HL$FI$LLpHRH*H|$@E1HJL%I$9fDLd$ Ht$LHT$H5L|$HfL$4Ht$HEHH:L%I$LIH LIH H|$ H|$@4HcSHmLLHT$DHHT$HHUH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(utH@]f.HHuϐHt$H|$tD$$Ht$u(HEHHuHcDHAU1IATUH`fnFdH%(HD$XHG~H%fn)fbtFH51HT$XdH+%(H`]A\A]H Ht$0HL$8T$HfD$@HIh(HtD$@+D$DH|$01f.H Ht$0HL$8T$HfD$@HIh(HGD$@+D$DVH|$01H Ht$HL$T$(fD$ HuXIh(HD$ +D$$tvH|$1LIHLIHuLIH oLd$Ht$LNHt$L9Ht$ L$D$$HEL$ T$t$HxH;1;Ht$H|$0|$DHt$HEHpHHHDLd$0Ht$LnHT$ H5L|$ HLL$DHt$+HEHH HHHHPLd$0LH5LHǾsHH5HHLHH5HHHH5H5LHH5L-HLL:HLHLH1L1hHLd$0LH5LHǾsHH5HHLHH5HHHH5H5LHH5L-HLLtNHLHLH1HHgHHHHfAU1ATUSHhHNdH%(HD$X1HGAfnH%fnA)fbAtAAH5D1HT$XdH+%(}Hh[]A\A]L Ht$ LL$(L$0T$4T$8HHo(HtwD$0+D$4ttH|$ 1@H Ht$ HL$(T$8fD$0HTHo(Ht!D$0+D$4tnH|$ 1-Ht$H|$ tT$4Ht$<HEHXHHuHLd$ Ht$LtLl$@LLsD$4L$HD$@\$PHt$ $fH~D$HELH` $D$f.D$@f.L$HufHnf.d$PzrupHHH fHH1HH%1HHHLLhLHD$ $UH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uNH0]fDHHuӐu$HHHHuH@HfUH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uNH0]fDHHuӐu$HPHHuH@HfUH@fnFdH%(HD$81HHt$HD$HGfnȉD$(fbfD$ uLHo(Ht!D$ +D$$tFH|$1HT$8dH+%(uzH@]f.HHuϐH5HT$H|$|$HtD$$u(HEH8HuHH@HSH0fnFdH%(HD$(1HH4$HD$HGfnȉD$fbfD$u=H(HtD$9D$t:H111HT$(dH+%(uMH0[fDHHuӐu$HHuHcDf.f(fz"u f.zuf.z uHHf.f(fz"u f.zuf.z uHHSafeDownCastvtkObjectBasevtkHyperOctreeGetDatavtkInformationvtkInformationVectorInitializeSIZESDIMENSIONLEVELSIsTypeOfGetLeafIndexGetLevelGetTreeToRootGetIsLeafToChildGetNumberOfLeavesGetDimensionGetNumberOfLevelsNewCellCursorGetLeafDataGetOriginGetSizeGetDualGridFlagSetDualGridFlagSetDimensionCollapseTerminalNodevtkHyperOctreeCursorSubdivideLeafGetMaxNumberOfCellsOnBoundaryGetMaxNumberOfPointsGetPointsOnFacevtkHyperOctreePointsGrabberGetPointsOnEdge2DGetPointsOnParentEdge2DNewInstanceGetPointsOnEdgeGetPointsOnParentEdgeIsAGetPointsOnParentFacesSetOriginSetSizeGetActualMemorySizeDeepCopyShallowCopyGetMaxCellSizeFindCellvtkCellvtkGenericCellFindPointGetCellNeighborsvtkIdListGetPointCellsGetCellPointsGetCellTypeGetCellGetPointGetNumberOfPointsGetNumberOfCellsCopyStructureGetDataObjectTypeV *vtkInformationV|i *vtkInformationVectorvtkHyperOctreeLightWeightCursorthis function takes no keyword argumentsGetMaxNumberOfPointsOnBoundaryvtkHyperOctree - A dataset structured as a tree where each node has exactly 2^n children. Superclass: vtkDataSet An hyperoctree is a dataset where each node has either exactly 2^n children or no child at all if the node is a leaf. `n' is the dimension of the dataset (1 (binary tree), 2 (quadtree) or 3 (octree) ). The class name comes from the following paper: @ARTICLE{yau-srihari-1983, author={Mann-May Yau and Sargur N. Srihari}, title={A Hierarchical Data Structure for Multidimensional Digital Images}, journal={Communications of the ACM}, month={July}, year={1983}, volume={26}, number={7}, pages={504--515} } Each node is a cell. Attributes are associated with cells, not with points. The geometry is implicitly given by the size of the root node on each axis and position of the center and the orientation. (TODO: review center position and orientation). The geometry is then not limited to an hybercube but can have a rectangular shape. Attributes are associated with leaves. For LOD (Level-Of-Detail) purpose, attributes can be computed on none-leaf nodes by computing the average values from its children (which can be leaves or not). By construction, an hyperoctree is efficient in memory usage when the geometry is sparse. The LOD feature allows to cull quickly part of the dataset. A couple of filters can be applied on this dataset: contour, outline, geometry. * 3D case (octree) for each node, each child index (from 0 to 7) is encoded in the following orientation. It is easy to access each child as a cell of a grid. Note also that the binary representation is relevant, each bit code a side: bit 0 encodes -x side (0) or +x side (1) bit 1 encodes -y side (0) or +y side (1) bit 2 encodes -z side (0) or +z side (2) - the -z side first - 0: -y -x sides - 1: -y +x sides - 2: +y -x sides - 3: +y +x sides +y +-+-+ ^ |2|3| | +-+-+ O +z +-> +x |0|1| +-+-+ - then the +z side, in counter-clockwise - 4: -y -x sides - 5: -y +x sides - 6: +y -x sides - 7: +y +x sides +y +-+-+ ^ |6|7| | +-+-+ O +z +-> +x |4|5| +-+-+ The cases with fewer dimensions are consistent with the octree case: * Quadtree: in counter-clockwise - 0: -y -x edges - 1: -y +x edges - 2: +y -x edges - 3: +y +x edges +y +-+-+ ^ |2|3| | +-+-+ O+-> +x |0|1| +-+-+ * Binary tree: +0+1+ O+-> +x @warning It is not a spatial search object! If you looking for this kind of octree see vtkCellLocator instead. @sa vtkHyperOctreeAlgorithm vtkHyperOctreeLightWeightCursor - no description provided. vtkHyperOctreeLightWeightCursor() vtkHyperOctreeLightWeightCursor( const &vtkHyperOctreeLightWeightCursor) vtkCommonDataModelPython.vtkHyperOctreeLightWeightCursor@W vtkHyperOctreeLightWeightCursorV.Initialize(vtkHyperOctree) C++: void Initialize(vtkHyperOctree *tree) V.ToRoot() C++: void ToRoot() V.ToChild(int) C++: void ToChild(int child) V.GetIsLeaf() -> int C++: unsigned short GetIsLeaf() V.GetLeafIndex() -> int C++: int GetLeafIndex() V.GetTree() -> vtkHyperOctree C++: vtkHyperOctree *GetTree() V.GetLevel() -> int C++: unsigned short GetLevel() vtkCommonDataModelPython.vtkHyperOctreeV.LEVELS() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *LEVELS() V.DIMENSION() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *DIMENSION() V.SIZES() -> vtkInformationDoubleVectorKey C++: static vtkInformationDoubleVectorKey *SIZES() V.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) -> vtkHyperOctree C++: static vtkHyperOctree *SafeDownCast(vtkObjectBase *o) V.NewInstance() -> vtkHyperOctree C++: vtkHyperOctree *NewInstance() V.GetDataObjectType() -> int C++: int GetDataObjectType() override; Return what type of dataset this is. V.CopyStructure(vtkDataSet) C++: void CopyStructure(vtkDataSet *ds) override; Copy the geometric and topological structure of an input rectilinear grid object. V.GetDimension() -> int C++: int GetDimension() Return the dimension of the tree (1D:binary tree(2 children), 2D:quadtree(4 children), 3D:octree (8 children)) \post valid_result: result>=1 && result<=3 V.SetDimension(int) C++: void SetDimension(int dim) Set the dimension of the tree with `dim'. See GetDimension() for details. \pre valid_dim: dim>=1 && dim<=3 \post dimension_is_set: GetDimension()==dim V.GetNumberOfCells() -> int C++: vtkIdType GetNumberOfCells() override; Return the number of cells in the dual grid. \post positive_result: result>=0 V.GetNumberOfLeaves() -> int C++: vtkIdType GetNumberOfLeaves() Get the number of leaves in the tree. V.GetNumberOfPoints() -> int C++: vtkIdType GetNumberOfPoints() override; Return the number of points in the dual grid. \post positive_result: result>=0 V.GetMaxNumberOfPoints(int) -> int C++: vtkIdType GetMaxNumberOfPoints(int level) Return the number of points corresponding to an hyperoctree starting at level `level' where all the leaves at at the last level. In this case, the hyperoctree is like a uniform grid. So this number is the number of points of the uniform grid. \pre positive_level: level>=0 && levelGetNumberOfLevels() \post definition: result==(2^(GetNumberOfLevels()-level-1)+1)^GetDimension() V.GetMaxNumberOfPointsOnBoundary(int) -> int C++: vtkIdType GetMaxNumberOfPointsOnBoundary(int level) Return the number of points corresponding to the boundary of an hyperoctree starting at level `level' where all the leaves at at the last level. In this case, the hyperoctree is like a uniform grid. So this number is the number of points of on the boundary of the uniform grid. For an octree, the boundary are the faces. For a quadtree, the boundary are the edges. \pre 2d_or_3d: this->GetDimension()==2 || this->GetDimension()==3 \pre positive_level: level>=0 && levelGetNumberOfLevels() \post min_result: result>=GetMaxNumberOfPoints(this->GetNumberOfLevels()-1) \post max_result: result<=GetMaxNumberOfPoints(level) V.GetMaxNumberOfCellsOnBoundary(int) -> int C++: vtkIdType GetMaxNumberOfCellsOnBoundary(int level) Return the number of cells corresponding to the boundary of a cell of level `level' where all the leaves at at the last level. \pre positive_level: level>=0 && levelGetNumberOfLevels() \post positive_result: result>=0 V.GetNumberOfLevels() -> int C++: vtkIdType GetNumberOfLevels() Return the number of levels. \post result_greater_or_equal_to_one: result>=1 V.SetSize(float, float, float) C++: void SetSize(double, double, double) V.SetSize((float, float, float)) C++: void SetSize(double a[3]) V.GetSize() -> (float, float, float) C++: double *GetSize() V.SetOrigin(float, float, float) C++: void SetOrigin(double, double, double) V.SetOrigin((float, float, float)) C++: void SetOrigin(double a[3]) V.GetOrigin() -> (float, float, float) C++: double *GetOrigin() V.NewCellCursor() -> vtkHyperOctreeCursor C++: vtkHyperOctreeCursor *NewCellCursor() Create a new cursor: an object that can traverse the cell of an hyperoctree. \post result_exists: result!=0 V.SubdivideLeaf(vtkHyperOctreeCursor) C++: void SubdivideLeaf(vtkHyperOctreeCursor *leaf) Subdivide node pointed by cursor, only if its a leaf. At the end, cursor points on the node that used to be leaf. \pre leaf_exists: leaf!=0 \pre is_a_leaf: leaf->CurrentIsLeaf() V.CollapseTerminalNode(vtkHyperOctreeCursor) C++: void CollapseTerminalNode(vtkHyperOctreeCursor *node) Collapse a node for which all children are leaves. At the end, cursor points on the leaf that used to be a node. \pre node_exists: node!=0 \pre node_is_node: !node->CurrentIsLeaf() \pre children_are_leaves: node->CurrentIsTerminalNode() V.GetPoint(int) -> (float, float, float) C++: double *GetPoint(vtkIdType ptId) override; V.GetPoint(int, [float, float, float]) C++: void GetPoint(vtkIdType id, double x[3]) override; Get point coordinates with ptId such that: 0 <= ptId < NumberOfPoints. THIS METHOD IS NOT THREAD SAFE. V.GetCell(int) -> vtkCell C++: vtkCell *GetCell(vtkIdType cellId) override; V.GetCell(int, vtkGenericCell) C++: void GetCell(vtkIdType cellId, vtkGenericCell *cell) override; V.GetCell(int, int, int) -> vtkCell C++: virtual vtkCell *GetCell(int i, int j, int k) Get cell with cellId such that: 0 <= cellId < NumberOfCells. THIS METHOD IS NOT THREAD SAFE. V.GetCellType(int) -> int C++: int GetCellType(vtkIdType cellId) override; Get type of cell with cellId such that: 0 <= cellId < NumberOfCells. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED V.GetCellPoints(int, vtkIdList) C++: void GetCellPoints(vtkIdType cellId, vtkIdList *ptIds) override; V.GetCellPoints(int, int, [int, ...]) C++: virtual void GetCellPoints(vtkIdType cellId, vtkIdType &npts, vtkIdType *&pts) Topological inquiry to get points defining cell. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED V.GetPointCells(int, vtkIdList) C++: void GetPointCells(vtkIdType ptId, vtkIdList *cellIds) override; Topological inquiry to get cells using point. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED V.GetCellNeighbors(int, vtkIdList, vtkIdList) C++: void GetCellNeighbors(vtkIdType cellId, vtkIdList *ptIds, vtkIdList *cellIds) override; Topological inquiry to get all cells using list of points exclusive of cell specified (e.g., cellId). Note that the list consists of only cells that use ALL the points provided. THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED V.FindPoint([float, float, float]) -> int C++: vtkIdType FindPoint(double x[3]) override; Locate the closest point to the global coordinate x. Return the point id. If point id < 0; then no point found. (This may arise when point is outside of dataset.) THIS METHOD IS THREAD SAFE IF FIRST CALLED FROM A SINGLE THREAD AND THE DATASET IS NOT MODIFIED V.FindCell([float, float, float], vtkCell, int, float, int, [float, float, float], [float, ...]) -> int C++: vtkIdType FindCell(double x[3], vtkCell *cell, vtkIdType cellId, double tol2, int &subId, double pcoords[3], double *weights) override; V.FindCell([float, float, float], vtkCell, vtkGenericCell, int, float, int, [float, float, float], [float, ...]) -> int C++: vtkIdType FindCell(double x[3], vtkCell *cell, vtkGenericCell *gencell, vtkIdType cellId, double tol2, int &subId, double pcoords[3], double *weights) override; Locate cell based on global coordinate x and tolerance squared. If cell and cellId is non-nullptr, then search starts from this cell and looks at immediate neighbors. Returns cellId >= 0 if inside, < 0 otherwise. The parametric coordinates are provided in pcoords[3]. The interpolation weights are returned in weights[]. (The number of weights is equal to the number of points in the found cell). Tolerance is used to control how close the point is to be considered "in" the cell. THIS METHOD IS NOT THREAD SAFE. V.Initialize() C++: void Initialize() override; Restore data object to initial state, THIS METHOD IS NOT THREAD SAFE. V.GetMaxCellSize() -> int C++: int GetMaxCellSize() override; Convenience method returns largest cell size in dataset. This is generally used to allocate memory for supporting data structures. This is the number of points of a cell. THIS METHOD IS THREAD SAFE V.ShallowCopy(vtkDataObject) C++: void ShallowCopy(vtkDataObject *src) override; Shallow and Deep copy. V.DeepCopy(vtkDataObject) C++: void DeepCopy(vtkDataObject *src) override; Shallow and Deep copy. V.GetPointsOnFace(vtkHyperOctreeCursor, int, int, vtkHyperOctreePointsGrabber) C++: void GetPointsOnFace(vtkHyperOctreeCursor *sibling, int face, int level, vtkHyperOctreePointsGrabber *grabber) Get the points of node `sibling' on its face `face'. \pre sibling_exists: sibling!=0 \pre sibling_not_leaf: !sibling->CurrentIsLeaf() \pre sibling_3d: sibling->GetDimension()==3 \pre valid_face: face>=0 && face<6 \pre valid_level_not_leaf: level>=0 level<(this->GetNumberOfLevels()-1) V.GetPointsOnParentFaces([int, int, int], int, vtkHyperOctreeCursor, vtkHyperOctreePointsGrabber) C++: void GetPointsOnParentFaces(int faces[3], int level, vtkHyperOctreeCursor *cursor, vtkHyperOctreePointsGrabber *grabber) Get the points of the parent node of `cursor' on its faces `faces' at level `level' or deeper. \pre cursor_exists: cursor!=0 \pre cursor_3d: cursor->GetDimension()==3 \pre valid_level: level>=0 \pre boolean_faces: (faces[0]==0 || faces[0]==1) && (faces[1]==0 || faces[1]==1) && (faces[2]==0 || faces[2]==1) V.GetPointsOnEdge(vtkHyperOctreeCursor, int, int, int, int, vtkHyperOctreePointsGrabber) C++: void GetPointsOnEdge(vtkHyperOctreeCursor *sibling, int level, int axis, int k, int j, vtkHyperOctreePointsGrabber *grabber) Get the points of node `sibling' on its edge `axis','k','j'. If axis==0, the edge is X-aligned and k gives the z coordinate and j the y-coordinate. If axis==1, the edge is Y-aligned and k gives the x coordinate and j the z coordinate. If axis==2, the edge is Z-aligned and k gives the y coordinate and j the x coordinate. \pre sibling_exists: sibling!=0 \pre sibling_3d: sibling->GetDimension()==3 \pre sibling_not_leaf: !sibling->CurrentIsLeaf() \pre valid_axis: axis>=0 && axis<3 \pre valid_k: k>=0 && k<=1 \pre valid_j: j>=0 && j<=1 \pre valid_level_not_leaf: level>=0 level<(this->Input->GetNumberOfLevels()-1) V.GetPointsOnParentEdge(vtkHyperOctreeCursor, int, int, int, int, vtkHyperOctreePointsGrabber) C++: void GetPointsOnParentEdge(vtkHyperOctreeCursor *cursor, int level, int axis, int k, int j, vtkHyperOctreePointsGrabber *grabber) Get the points of the parent node of `cursor' on its edge `axis','k','j' at level `level' or deeper. If axis==0, the edge is X-aligned and k gives the z coordinate and j the y-coordinate. If axis==1, the edge is Y-aligned and k gives the x coordinate and j the z coordinate. If axis==2, the edge is Z-aligned and k gives the y coordinate and j the x coordinate. \pre cursor_exists: cursor!=0 \pre cursor_3d: cursor->GetDimension()==3 \pre valid_level: level>=0 \pre valid_range_axis: axis>=0 && axis<3 \pre valid_range_k: k>=0 && k<=1 \pre valid_range_j: j>=0 && j<=1 V.GetPointsOnEdge2D(vtkHyperOctreeCursor, int, int, vtkHyperOctreePointsGrabber) C++: void GetPointsOnEdge2D(vtkHyperOctreeCursor *sibling, int edge, int level, vtkHyperOctreePointsGrabber *grabber) Get the points of node `sibling' on its edge `edge'. \pre sibling_exists: sibling!=0 \pre sibling_not_leaf: !sibling->CurrentIsLeaf() \pre sibling_2d: sibling->GetDimension()==2 \pre valid_edge: edge>=0 && edge<4 \pre valid_level_not_leaf: level>=0 level<(this->Input->GetNumberOfLevels()-1) V.GetPointsOnParentEdge2D(vtkHyperOctreeCursor, int, int, vtkHyperOctreePointsGrabber) C++: void GetPointsOnParentEdge2D(vtkHyperOctreeCursor *cursor, int edge, int level, vtkHyperOctreePointsGrabber *grabber) Get the points of the parent node of `cursor' on its edge `edge' at level `level' or deeper. (edge=0 for -X, 1 for +X, 2 for -Y, 3 for +Y) \pre cursor_exists: cursor!=0 \pre cursor_2d: cursor->GetDimension()==2 \pre valid_level: level>=0 \pre valid_edge: edge>=0 && edge<4 V.GetLeafData() -> vtkDataSetAttributes C++: vtkDataSetAttributes *GetLeafData() A generic way to set the leaf data attributes. This can be either point data for dual or cell data for normal grid. V.SetDualGridFlag(int) C++: void SetDualGridFlag(int flag) Switch between returning leaves as cells, or the dual grid. V.GetDualGridFlag() -> int C++: virtual int GetDualGridFlag() Switch between returning leaves as cells, or the dual grid. V.GetActualMemorySize() -> int C++: unsigned long GetActualMemorySize() override; Return the actual size of the data in kibibytes (1024 bytes). This number is valid only after the pipeline has updated. The memory size returned is guaranteed to be greater than or equal to the memory required to represent the data (e.g., extra space in arrays, etc. are not included in the return value). THIS METHOD IS THREAD SAFE. V.GetData(vtkInformation) -> vtkHyperOctree C++: static vtkHyperOctree *GetData(vtkInformation *info) V.GetData(vtkInformationVector, int) -> vtkHyperOctree C++: static vtkHyperOctree *GetData(vtkInformationVector *v, int i=0) Retrieve an instance of this class from an information object. HLH}HEH9t HtHH}HEH9t HtHH|$@HtHD$HH9tHLHLHTp  8d $b6 ;e)c $    vtkDataSetvtkDataObjectvtkObjectUH=Hu]ÐHH=tHH=tHH=tH]fHVf(H H;ff(uDf.z"u f.zuf.z ufHVf(HHH;ff(uDf.z"u f.zuf.z uHHHHERROR: In /mnt/storage/workspace/med-ubuntu-free/ExtProjs/VTK/Common/DataModel/vtkDataSet.h, line ijk indices are only valid with structured data! (): ErrorEventAUATUHH0dH%(HD$(1u'HD$(dH+%(H01]A\A]ILH5LHǾsHH5HHLHH5HHHH5H5LHH5L-HLLu7HLH1LfDHLHHLH(HD!!GCC: (Ubuntu 11.4.0-1ubuntu1~22.04) 11.4.0GNUzRx P0 DPX l   EDPa AE EDPa AE (FAD` ABD #JUA(8FAK`t DBD dEDP AK EU ED@W AG ED@W AG ED@W AG zPLRx D$FAG q CBD D FBL Y KBJ l bEY B }rr(EAD`n AAF ED@ AG @ED@ AG dED@ AG H@ I ED@ AG EDP AK ED@ AG ED@ AG 4ED@ AG XED@ AG |ED@ AG ED@ AG ED@ AG ED@ AG EDP AK 0EDP AK TEDP AK xEDP AK EDP AK EDP AK EDP AK 8kFBB A(Dp (A BBBG 8DkFBB A(Dp (A BBBG 8kFBB A(Dp (A BBBG gFD@ EE LFBB A(D (A BBBG GXAL0FBB A(D (A BBBG GXA0FAA D`  AABH @FBB A(A0D 0A(A BBBE 4/FAD` ABG T GIL (0FCD ABD (\FCD ABD MFFAFz0FDD Q ABF \DB!  ED@ AG , EDP AK P EDP AK t ED@ AG  H@ I P[ EH Po D ._.._..O.n.J. > @, FBB A(A0D 0A(A BBBI @p rFBB B(A0Dp 0A(B BBBC ( /FAD` ABC <FGB A(Gk (D BBBD  ! @ EDP AK 4D aFBA GPq  CBBH 4| FGA Dp  ABBI  8 FDA A(Dr (A ABBH 0 ED@ AG T ED@ AG x EDP AK $ ED@ AG   " Q ~  # 1 o     / X ! p R @    @ P { @    B pp @ 0  * Y    A x k k k gF p x " # `%  @'/9 -``_  p(  @, + -@  + -@i -@# #!  @1  02!  @3O  P4  05  6[ >  pA4  Crg  D/  E N!  PI )*  `JT o  P  S  S TE U+-y~ *2AVagq x   #%)5/B5W;lAPGzMSY_ekqw}59/PZbv'((('h ( ( %*+;1I7p=p C"Pc" "P" " " 0U >]co6L[bp!0 4]m}"b"r"!r/?m .W|P"CUkCc(Gg 0M `0A 0#Nf/OVu1R(Rx")a ! > Y }     !!D!b!!!!! "."W""""""#(#9#L#d#y####_ZL26PyvtkHyperOctree_StaticNewv_ZL29PyvtkHyperOctree_SafeDownCastP7_objectS0__ZL27PyvtkHyperOctree_GetData_s1P7_objectS0__ZL27PyvtkHyperOctree_GetData_s2P7_objectS0__ZL39PyvtkHyperOctreeLightWeightCursor_CCopyPKv_ZL68PyvtkHyperOctreeLightWeightCursor_vtkHyperOctreeLightWeightCursor_s2P7_objectS0__ZL44PyvtkHyperOctreeLightWeightCursor_InitializeP7_objectS0__ZL40PyvtkHyperOctreeLightWeightCursor_DeleteP7_object_ZL38PyvtkHyperOctreeLightWeightCursor_HashP7_object_ZL22PyvtkHyperOctree_SIZESP7_objectS0__ZL26PyvtkHyperOctree_DIMENSIONP7_objectS0__ZL23PyvtkHyperOctree_LEVELSP7_objectS0__ZL37PyvtkHyperOctreeLightWeightCursor_NewP11_typeobjectP7_objectS2__ZL37PyvtkHyperOctreeLightWeightCursor_NewP11_typeobjectP7_objectS2_.cold_ZL25PyvtkHyperOctree_IsTypeOfP7_objectS0__ZL46PyvtkHyperOctreeLightWeightCursor_GetLeafIndexP7_objectS0__ZL42PyvtkHyperOctreeLightWeightCursor_GetLevelP7_objectS0__ZL41PyvtkHyperOctreeLightWeightCursor_GetTreeP7_objectS0__ZL40PyvtkHyperOctreeLightWeightCursor_ToRootP7_objectS0__ZL43PyvtkHyperOctreeLightWeightCursor_GetIsLeafP7_objectS0__ZL41PyvtkHyperOctreeLightWeightCursor_ToChildP7_objectS0__ZL34PyvtkHyperOctree_GetNumberOfLeavesP7_objectS0__ZL29PyvtkHyperOctree_GetDimensionP7_objectS0__ZL34PyvtkHyperOctree_GetNumberOfLevelsP7_objectS0__ZL30PyvtkHyperOctree_NewCellCursorP7_objectS0__ZL28PyvtkHyperOctree_GetLeafDataP7_objectS0__ZL26PyvtkHyperOctree_GetOriginP7_objectS0__ZL24PyvtkHyperOctree_GetSizeP7_objectS0__ZL32PyvtkHyperOctree_GetDualGridFlagP7_objectS0__ZL32PyvtkHyperOctree_SetDualGridFlagP7_objectS0__ZL29PyvtkHyperOctree_SetDimensionP7_objectS0__ZL37PyvtkHyperOctree_CollapseTerminalNodeP7_objectS0__ZL30PyvtkHyperOctree_SubdivideLeafP7_objectS0__ZL47PyvtkHyperOctree_GetMaxNumberOfPointsOnBoundaryP7_objectS0__ZL46PyvtkHyperOctree_GetMaxNumberOfCellsOnBoundaryP7_objectS0__ZL37PyvtkHyperOctree_GetMaxNumberOfPointsP7_objectS0__ZL32PyvtkHyperOctree_GetPointsOnFaceP7_objectS0__ZL34PyvtkHyperOctree_GetPointsOnEdge2DP7_objectS0__ZL40PyvtkHyperOctree_GetPointsOnParentEdge2DP7_objectS0__ZL28PyvtkHyperOctree_NewInstanceP7_objectS0__ZL32PyvtkHyperOctree_GetPointsOnEdgeP7_objectS0__ZL38PyvtkHyperOctree_GetPointsOnParentEdgeP7_objectS0__ZL20PyvtkHyperOctree_IsAP7_objectS0__ZL39PyvtkHyperOctree_GetPointsOnParentFacesP7_objectS0__ZL24PyvtkHyperOctree_GetDataP7_objectS0__ZL32PyvtkHyperOctree_GetData_Methods_ZL26PyvtkHyperOctree_SetOriginP7_objectS0__ZL24PyvtkHyperOctree_SetSizeP7_objectS0__ZL21PyvtkHyperOctree_Type_ZL24PyvtkHyperOctree_Methods_ZL38PyvtkHyperOctreeLightWeightCursor_Type_ZL73PyvtkHyperOctreeLightWeightCursor_vtkHyperOctreeLightWeightCursor_Methods_ZL41PyvtkHyperOctreeLightWeightCursor_Methods_GLOBAL__sub_I_vtkHyperOctreePython.cxx_ZL36PyvtkHyperOctree_GetActualMemorySizeP7_objectS0__ZL25PyvtkHyperOctree_DeepCopyP7_objectS0__ZL28PyvtkHyperOctree_ShallowCopyP7_objectS0__ZL31PyvtkHyperOctree_GetMaxCellSizeP7_objectS0__ZL27PyvtkHyperOctree_InitializeP7_objectS0__ZL25PyvtkHyperOctree_FindCellP7_objectS0__ZL25PyvtkHyperOctree_FindCellP7_objectS0_.cold_ZL26PyvtkHyperOctree_FindPointP7_objectS0__ZL33PyvtkHyperOctree_GetCellNeighborsP7_objectS0__ZL30PyvtkHyperOctree_GetPointCellsP7_objectS0__ZL30PyvtkHyperOctree_GetCellPointsP7_objectS0__ZL30PyvtkHyperOctree_GetCellPointsP7_objectS0_.cold_ZL28PyvtkHyperOctree_GetCellTypeP7_objectS0__ZL24PyvtkHyperOctree_GetCellP7_objectS0__ZL24PyvtkHyperOctree_GetCellP7_objectS0_.cold_ZL25PyvtkHyperOctree_GetPointP7_objectS0__ZL34PyvtkHyperOctree_GetNumberOfPointsP7_objectS0__ZL33PyvtkHyperOctree_GetNumberOfCellsP7_objectS0__ZL30PyvtkHyperOctree_CopyStructureP7_objectS0__ZL34PyvtkHyperOctree_GetDataObjectTypeP7_objectS0_.LC0.LC1.LC2.LC3.LC4.LC5.LC6.LC7.LC8.LC9.LC10.LC11.LC16.LC13.LC14.LC15.LC17.LC18.LC19.LC20.LC21.LC22.LC23.LC24.LC25.LC26.LC27.LC28.LC29.LC30.LC31.LC32.LC33.LC34.LC35.LC36.LC37.LC38.LC39.LC40.LC41.LC42.LC43.LC44.LC45.LC46.LC47.LC48.LC49.LC50.LC53.LC54.LC55.LC56.LC57.LC58.LC59.LC61.LC62.LC63.LC64.LC65.LC67.LC75.LC68.LC69.LC70.LC71.LC72.LC73.LC74.LC77.LC78.LC79.LC80.LC81.LC51.LC52_ZN14vtkHyperOctree7SetSizeEddd_ZN14vtkHyperOctree7GetSizeEv_ZN14vtkHyperOctree9SetOriginEddd_ZN14vtkHyperOctree9GetOriginEv_ZN14vtkHyperOctree15GetDualGridFlagEv_ZN14vtkHyperOctree3NewEv_ZNK14vtkHyperOctree19NewInstanceInternalEv_ZN13vtkPythonArgs13ArgCountErrorEii_ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRbPyErr_Occurred_ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__stack_chk_fail_ZN14vtkHyperOctree7GetDataEP14vtkInformation_ZN14vtkHyperOctree7GetDataEP20vtkInformationVectori_ZN13vtkPythonArgs8GetValueERi_Znwm_Py_Dealloc_ZN13vtkPythonArgs21GetArgAsSpecialObjectEPKcPP7_objectPyVTKSpecialObject_New_ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1__ZN31vtkHyperOctreeLightWeightCursor10InitializeEP14vtkHyperOctree_GLOBAL_OFFSET_TABLE__Py_NoneStruct_ZdlPvPyObject_FreePyObject_HashNotImplemented_ZN14vtkHyperOctree5SIZESEv_ZN14vtkHyperOctree9DIMENSIONEv_ZN14vtkHyperOctree6LEVELSEvDW.ref.__gxx_personality_v0PyDict_Size_ZN13vtkPythonArgs13ArgCountErrorEiPKc_ZN31vtkHyperOctreeLightWeightCursorC1EvPyExc_TypeErrorPyErr_SetString_Unwind_Resume_ZN14vtkHyperOctree3IsAEPKcstrcmp_ZN13vtkObjectBase8IsTypeOfEPKc_ZN14vtkHyperOctree7SetSizeEPd_ZN14vtkHyperOctree9SetOriginEPd_ZN13vtkPythonArgs8GetValueERPcPyLong_FromLong_ZN31vtkHyperOctreeLightWeightCursor6ToRootEv_ZN31vtkHyperOctreeLightWeightCursor9GetIsLeafEv_ZN31vtkHyperOctreeLightWeightCursor7ToChildEi_ZN14vtkHyperOctree17GetNumberOfLeavesEvPyLong_FromLongLong_ZN14vtkHyperOctree12GetDimensionEv_ZN14vtkHyperOctree17GetNumberOfLevelsEv_ZN14vtkHyperOctree13NewCellCursorEv_ZN14vtkHyperOctree11GetLeafDataEv_ZN13vtkPythonArgs10BuildTupleEPKdi_ZN14vtkHyperOctree15SetDualGridFlagEi_ZN14vtkHyperOctree12SetDimensionEi_ZN14vtkHyperOctree20CollapseTerminalNodeEP20vtkHyperOctreeCursor_ZN14vtkHyperOctree13SubdivideLeafEP20vtkHyperOctreeCursor_ZN14vtkHyperOctree30GetMaxNumberOfPointsOnBoundaryEi_ZN14vtkHyperOctree29GetMaxNumberOfCellsOnBoundaryEi_ZN14vtkHyperOctree20GetMaxNumberOfPointsEi_ZN14vtkHyperOctree15GetPointsOnFaceEP20vtkHyperOctreeCursoriiP27vtkHyperOctreePointsGrabber_ZN14vtkHyperOctree17GetPointsOnEdge2DEP20vtkHyperOctreeCursoriiP27vtkHyperOctreePointsGrabber_ZN14vtkHyperOctree23GetPointsOnParentEdge2DEP20vtkHyperOctreeCursoriiP27vtkHyperOctreePointsGrabberPyVTKObject_CheckPyVTKObject_GetObjectPyVTKObject_SetFlag_ZN14vtkHyperOctree15GetPointsOnEdgeEP20vtkHyperOctreeCursoriiiiP27vtkHyperOctreePointsGrabber_ZN14vtkHyperOctree21GetPointsOnParentEdgeEP20vtkHyperOctreeCursoriiiiP27vtkHyperOctreePointsGrabber_ZN13vtkPythonArgs8GetArrayEPii_ZN14vtkHyperOctree22GetPointsOnParentFacesEPiiP20vtkHyperOctreeCursorP27vtkHyperOctreePointsGrabber_ZN13vtkPythonArgs8SetArrayEiPKii_ZN17vtkPythonOverload10CallMethodEP11PyMethodDefP7_objectS3__ZN13vtkPythonArgs8GetValueERd_ZN13vtkPythonArgs8GetArrayEPdiPyvtkHyperOctree_ClassNewPyVTKClass_AddPyvtkDataSet_ClassNewPyType_ReadyPyvtkHyperOctreeLightWeightCursor_TypeNewPyVTKSpecialType_AddPyVTKAddFile_vtkHyperOctreePyDict_SetItemString_ZN14vtkHyperOctree19GetActualMemorySizeEvPyLong_FromUnsignedLong_ZN14vtkHyperOctree8DeepCopyEP13vtkDataObject_ZN14vtkHyperOctree11ShallowCopyEP13vtkDataObject_ZN14vtkHyperOctree14GetMaxCellSizeEv_ZN14vtkHyperOctree10InitializeEv_ZN13vtkPythonArgs10GetArgSizeEi_ZN13vtkPythonArgs5ArrayIdEC1El_ZdaPv_ZN13vtkPythonArgs8GetValueERx_ZN13vtkPythonArgs8SetArrayEiPKdi_ZN14vtkHyperOctree8FindCellEPdP7vtkCellP14vtkGenericCellxdRiS0_S0__ZN13vtkPythonArgs11SetArgValueEii_ZN14vtkHyperOctree8FindCellEPdP7vtkCellxdRiS0_S0__ZN14vtkHyperOctree9FindPointEPd_ZN14vtkHyperOctree16GetCellNeighborsExP9vtkIdListS1__ZN14vtkHyperOctree13GetPointCellsExP9vtkIdList_ZN13vtkPythonArgs5ArrayIxEC1El_ZN13vtkPythonArgs8GetArrayEPxi_ZN14vtkHyperOctree13GetCellPointsExP9vtkIdList_ZN14vtkHyperOctree13GetCellPointsExRxRPx_ZN13vtkPythonArgs11SetArgValueEiPKxi_ZN13vtkPythonArgs11SetArgValueEix_ZN14vtkHyperOctree11GetCellTypeEx_ZN10vtkDataSet7GetCellEiii_ZN9vtkObject23GetGlobalWarningDisplayEv_ZN20vtkOStrStreamWrapperC1Ev_ZN17vtkOStreamWrapperlsEPKc_ZN17vtkOStreamWrapperlsEi_ZNK13vtkObjectBase12GetClassNameEv_ZN17vtkOStreamWrapperlsEPv_ZN9vtkObject11HasObserverEPKc_ZN20vtkOStrStreamWrapper3strEv_Z31vtkOutputWindowDisplayErrorTextPKc_ZN20vtkOStrStreamWrapper5rdbufEv_ZN20vtkOStrStreamWrapper6freezeEi_ZN9vtkObject12BreakOnErrorEv_ZN20vtkOStrStreamWrapperD1Ev_ZN9vtkObject11InvokeEventEPKcPv_ZN14vtkHyperOctree7GetCellEx_ZN14vtkHyperOctree7GetCellExP14vtkGenericCell_ZN14vtkHyperOctree8GetPointEx_ZN14vtkHyperOctree8GetPointExPd_ZN14vtkHyperOctree17GetNumberOfPointsEv_ZN14vtkHyperOctree16GetNumberOfCellsEv_ZN14vtkHyperOctree13CopyStructureEP10vtkDataSet_ZN14vtkHyperOctree17GetDataObjectTypeEvPyType_TypePyVTKSpecialObject_ReprPyObject_GenericGetAttrPyVTKObject_DeletePyVTKObject_ReprPyVTKObject_StringPyObject_GenericSetAttrPyVTKObject_AsBufferPyVTKObject_TraversePyVTKObject_GetSetPyVTKObject_NewPyObject_GC_Del,^`_` a@mbra c2:pd>qeJq`*fFiqg<hfd!/dC*JiRj `#k(1>NlSamfr{n $ 1 8 a o     ! pn      q- Q a f r *}  r ! 1 8 E L q s     , *7 a t      1u~v>aqyw1AIV]x&-ay*#Qz*A{*!|z*}j*~Z*Z*ZJq:a{4px*G&GL\*qPXo~*"o*`  5 D c   0!8!O!`!q!!!!!!!*!"G"""""#!#4#H#P#}###*###V$$$$*$`$$k$$$%l#%1%m6%B%Z%%%&&7&G&R&c&p&&&&*&'('/'|'a''c''''6(]\K(aR(d(k(()#)+)S)))))*H*****A+Q+*a++*+*/,,,,,#-p-----.*..*/!/*1/Z/*t/*/0\'0`.0]<60<0\DD0N0\S0i0\w0]~0]<00\000`000d0#1a111122!2(2Q2222l23"3*43;3a3333l4&424*D4K4q4445 55"5P5e5555*56p6u6666<7d7{7778o888888"9<9:<;J;[;;;;;;;<><h<<=>>>>>>?1?B?i?? ?? ? C@ _@ i@@ @ @@ @.A JA AA!BFBBBB BC CICCCCCDADQD*aDDDDEAE^EnEvEEE*EE+F3FcFFFF G7G[GqGGGGGGG*H2H:HkH{H*HHHHHII5I?IqIII J0J=JLJUJJJJ>KSKKKK L,LDLnLLLL*LL!M2MNMbMjMMM*M&MMMMMN NN!N&N1N;N@NGNONYN^NeNpNNN%N!N"N#N$N'NNNNNOOOO#O(O3O=OBOIOQO[O`OgOrO~OO%O!O"O#OO OO O\PdPPPP2QKQuQQQQARQR*aRRR(RR R)R!SnSSSSS*STNTqTTTT+TT:UaUsUkUUU*U,UU>VaVVVV-V7`=(;1[A gA+KIJOkO{ #+BJcks${$`&k+9l>LmQ^**\L\E!W^fs}  !"#!$1?%FU$]. 0X/x08@. 12(30084@5X6789` @ VHX ` h x  P    (  `     @  @ qH X8 ` ghx  a  xpP 5#X P   I(U8@ ;HTXx` hx  5 *S @ X S ` P(8@@ zHX ` hxh Z@, 0 Pp( @`   l(8p@ BHX` hPx  `J" PIp# Eh$ D%  C&  (pA8(@ H6X)` Vh05x . P4. @3/ v020 x0 9`%h2  (p 84@ H "X7` h x; = p? %?  P@ b@1@  *(@'8xBhx [ m 4H\p  <h 3HQp D@ h   P @ 8\p@0 4X| H p 4 "#`%@'4p(`@,0`00E @10 02T @3x P4 05 6   V0 pAt  C D E ^$ N- zD PIh Tq  `J  o  P4 SX S| T U.symtab.strtab.shstrtab.rela.text.data.bss.text._ZN14vtkHyperOctree7SetSizeEddd.text._ZN14vtkHyperOctree7GetSizeEv.text._ZN14vtkHyperOctree9SetOriginEddd.text._ZN14vtkHyperOctree9GetOriginEv.text._ZN14vtkHyperOctree15GetDualGridFlagEv.rela.text._ZNK14vtkHyperOctree19NewInstanceInternalEv.rodata.str1.1.rodata.str1.8.rela.text.unlikely.gcc_except_table.rodata._ZN14vtkHyperOctree3IsAEPKc.str1.1.rela.text._ZN14vtkHyperOctree3IsAEPKc.rela.text._ZN14vtkHyperOctree7SetSizeEPd.rela.text._ZN14vtkHyperOctree9SetOriginEPd.rela.text.startup.rela.init_array.rodata._ZN10vtkDataSet7GetCellEiii.str1.8.rodata._ZN10vtkDataSet7GetCellEiii.str1.1.rela.text._ZN10vtkDataSet7GetCellEiii.rela.data.rel.rela.data.rel.local.rodata.cst8.rela.data.rel.local.DW.ref.__gxx_personality_v0.comment.note.GNU-stack.note.gnu.property.rela.eh_frame.groupW@7WH7WP7WX7W`7Wh 7Wt 7W 7W 7W 7W 7 V@D7 &VW,VW1`WPWW {WPX  X 0X @B7-29X<2[CP`K@B 7_q2#b@D7Pr@D7Сr@E7!P!@ E`7#1x,@E7%=2h20a@E7)8 @H7+ @`J7-@hZ700,%ܯ5 M H@Z75p8 0#c^