(00__text__TEXT0C__gcc_except_tab__TEXT0CE__data__DATAC F__cstring__TEXTN#GQ__compact_unwind__LD`K__eh_frame__TEXTX  h2   PIIMUHH=H5HNH uHH=H]ÐUH]fDUHH=H5HH u H=H]f.Ht(UHSPHH HSHHPH[]1UHSPHH=H5HMH uHH=H5MHHtH u H=H=H5HH u H=H5HMHHt H tH[]H=H[]@UHSH(HuH@WHEFEHEtH}111!HHt1 HHHH([]f.UHSH(HuH/WHEFEHEtH}111!HHt1 HHHH([]f.UHSH(HuH'WHEFEHEtH}111!HHt1 HHHH([]f.UHAVSH0HuHWHEЋFEHEHEH}ȃHuH]H=WKHAtDH=Ht1H=HtH=Ht HLcHuL1H0[A^]UHAWAVSH(HuHCWHED~D}HG]ԉ]؅yHHLw(HEMA)Au{HuH}}L}tH=>JLAtuH=LtbH=LtOH=LtHhH #HhH(HhHuHhHuHhLDE0E@EPE8EHEDHXE.A1HXH5P1MHhHh1HHH9t HtHHH;EYHH[A\A]A^A_]E1E1H`II9s0II9s'1HXII9s5II9s,1HpHHH‰уH s01HpHHH‰уH 1*HH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuH`H9)HHHHtI4I4HHuHH`rWI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u|H (tL4$HuLELMLH"IHL4$HuLELMLHIEf.Xu$z"Ef.8uzEf.Hu{!HuHhHU1HuUHhEf.0u$z"Ef.@uzEf.Pu{$HuHhHUE~A1AfA.uzHH9`u!HuHhLDHmLHH)1AALAALAD AL0AD AL0AD@ALPAD@ALPAD`ALpAD`ALpHHuHt*HHADA ADA H HuHXH9)HHHHtI4I4HHuHHXrWI I ILILILILILILIL IL IL(IL(IL0IL0IL8IL8HH9u|L (t)Lt$HEH$HuLMLHH`.IHLt$HMH $HuLMLHH`IEf.0u$z"Ef.@uzEf.Pu{!HuHhHU1HuUHhEf.8u$z"Ef.HuzEf.u{$HuHhHUE~A1AfA.uzHH9Xu!HuHhLDHLHHHH9HHHH9t HtH f.UHAVSH HuHNHEDvDuHG]]y HHt"H(HtD9uEt$Ht(1.H}111HHuHHHH [A^]UHAVSH HuHMHEDvDuHG]]y HHt$H(HtD9uEt&Ht*11H}111 HHuHcHHH [A^]UHAWAVSH(HuHNNHED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5bH}HU}t0}t7LHHu9H}1H([A^A_]ILHHuHHUHAWAVSH(HuHMHED~D}HG]ԉ]؅y HHt\Lw(MtSA)Au7H5aH}HU}t0}t7LHHu9H}1H([A^A_]ILHHuHHUHAWAVSH8HuHqMHEDvDuHG]̉]ЅyHHL(MA)AH5 aH}HU}t|IHuH}thHuH}tWH5aH}HU}t=U܋MLLIHuHHH}1H8[A^A_]DUHAWAVSHHHHHEHuHRNHEDvDuHG]]yHHL(MA)H}AHuԺH}HuH5_H}HU}IH5}`H}HU}t~M܉MHMHMȋUHuLLIE;EuE;EuE;EtHuH}HU1HuHH1H H H;MuHH[A^A_]E1MfUHAWAVSHHHuH OHEDvDuHG]ĉ]ȅyHHL(MA)AH5j^H}HU}IH}HuH}HuH}HutqH}Hut`H5^H}HU}tFUMDEDMH$LLHuHHH}1HH[A^A_]E1M UHAWAVSHHHuH QHEDvDuHG]ĉ]ȅyHHL(MA)AH5]H}HU}IH}HuH}HuH}HutqH}Hut`H5]H}HU}tFUMDEDMH$LLHuHHH}1HH[A^A_]E1M UHAWAVSH8HuHSHEDvDuHG]̉]ЅyHHL(MA)AH5[H}HU}t|IHuH}thHuH}tWH5l\H}HU}t=U܋MLLIHuHHH}1H8[A^A_]DUHAWAVSH8HuH THEDvDuHG]̉]ЅyHHL(MA)AH5ZH}HU}t|IHuH}thHuH}tWH5\[H}HU}t=U܋MLLIHuHHH}1H8[A^A_]DUHAVSH HuHUHEDvDuHG]]y HHt H(HtD9uHHt1H}111 HHHH [A^]f.fUHAWAVSH(HuH5UHED~D}HG]ԉ]؅y HHtWLw(MtNA)Au2HuH}t4uLHuHHH}1H([A^A_]fUHAVSH HuHUHEDvDuHG]]y HHt#H(HtD9uEt%Ht*11H}111 HxHuHcHHH [A^]@UHAVSH HuHTHEDvDuHG]]y HHt%H(HtD9uEt'HHt+1>H}111-HHHuHHxHHH [A^]DUHHHztuHH]H=]H5U1]UHAVSH IH]HH5WHHǾsH5VWHMt=LH}HH50WHHLH5WHH5WH}H5/WHMt0H5WLtH}H5WLHH}HH}H1H}1H [A^]HH}H DUHSH(HuHdTHE؋FEHEEȃrH}о1[H5VH}HUH1}tH5VH}HU}t7HHHu"HH([]H}о1H([]f.UHSPHHHtHH[]f.UH]fDUHAVSHHt%HHtHH8H5NVN{t,u6HHH=H[A^]1H[A^]H51[A^]IHL fUHSH(HuHHE؋FEHEHEuQH5H}HUHtKHÿH HSHHPH=QHHH}Hu (H}о1H}Ht HuHH([]f.UHAWAVSH(HuHf<HED~D}HG]ԉ]؅y HHt`LwMtWA)Au;H5H}HU}t4LHHuHHH}1H([A^A_]fUHAVSH HuHTHEDvDuHG]]y HHtHHtD9uHt1H}111 HHHH [A^]UHAWAVSH(HuHMTHED~D}HG]ԉ]؅y HHtWLwMtNA)Au2HuH}t4uLHuHHH}1H([A^A_]fUHAVSH HuHSHEDvDuHG]]y HHtHHtD9uHt1H}111 HHH [A^]f.UHAVSH HuHvSHEDvDuHG]]y HHtHGHtD9uHcXHt1H}111 HHHH [A^]UHAVSH HuH%SHEDvDuHG]]y HHtHGHtD9uHHt1H}111 HHHH [A^]ÐUHAVSH HuHRHEDvDuHG]]y HHtHGHtD9uXHt1H}111 HHHH [A^]&SZQS> T''* MMUINHD'O$Y+YYYYYQZZZ[[_[T\a\\\!]3]]]N^[^'_4_````$a6aaaccff!h3hhhUi]iii8jBjjjUkckqllmmooxppvqqssttuu%w.w^{i{{{|}l}u}}}$ẍŊ݊ʌ֌&6Ǝhp(O^{$nu˔Ք KSЕ!ƒ!ؒvtkHyperOctreevtkHyperOctreeLightWeightCursorvtkCommonDataModelPython.vtkHyperOctreevtkHyperOctree - 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 LEVELSV.LEVELS() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *LEVELS() DIMENSIONV.DIMENSION() -> vtkInformationIntegerKey C++: static vtkInformationIntegerKey *DIMENSION() SIZESV.SIZES() -> vtkInformationDoubleVectorKey C++: static vtkInformationDoubleVectorKey *SIZES() IsTypeOfV.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. IsAV.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. SafeDownCastV.SafeDownCast(vtkObjectBase) -> vtkHyperOctree C++: static vtkHyperOctree *SafeDownCast(vtkObjectBase *o) NewInstanceV.NewInstance() -> vtkHyperOctree C++: vtkHyperOctree *NewInstance() GetDataObjectTypeV.GetDataObjectType() -> int C++: int GetDataObjectType() override; Return what type of dataset this is. CopyStructureV.CopyStructure(vtkDataSet) C++: void CopyStructure(vtkDataSet *ds) override; Copy the geometric and topological structure of an input rectilinear grid object. GetDimensionV.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 SetDimensionV.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 GetNumberOfCellsV.GetNumberOfCells() -> int C++: vtkIdType GetNumberOfCells() override; Return the number of cells in the dual grid. \post positive_result: result>=0 GetNumberOfLeavesV.GetNumberOfLeaves() -> int C++: vtkIdType GetNumberOfLeaves() Get the number of leaves in the tree. GetNumberOfPointsV.GetNumberOfPoints() -> int C++: vtkIdType GetNumberOfPoints() override; Return the number of points in the dual grid. \post positive_result: result>=0 GetMaxNumberOfPointsV.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() GetMaxNumberOfPointsOnBoundaryV.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) GetMaxNumberOfCellsOnBoundaryV.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 GetNumberOfLevelsV.GetNumberOfLevels() -> int C++: vtkIdType GetNumberOfLevels() Return the number of levels. \post result_greater_or_equal_to_one: result>=1 SetSizeV.SetSize(float, float, float) C++: void SetSize(double, double, double) V.SetSize((float, float, float)) C++: void SetSize(double a[3]) GetSizeV.GetSize() -> (float, float, float) C++: double *GetSize() SetOriginV.SetOrigin(float, float, float) C++: void SetOrigin(double, double, double) V.SetOrigin((float, float, float)) C++: void SetOrigin(double a[3]) GetOriginV.GetOrigin() -> (float, float, float) C++: double *GetOrigin() NewCellCursorV.NewCellCursor() -> vtkHyperOctreeCursor C++: vtkHyperOctreeCursor *NewCellCursor() Create a new cursor: an object that can traverse the cell of an hyperoctree. \post result_exists: result!=0 SubdivideLeafV.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() CollapseTerminalNodeV.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() GetPointV.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. GetCellV.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. GetCellTypeV.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 GetCellPointsV.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 GetPointCellsV.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 GetCellNeighborsV.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 FindPointV.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 FindCellV.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. InitializeV.Initialize() C++: void Initialize() override; Restore data object to initial state, THIS METHOD IS NOT THREAD SAFE. GetMaxCellSizeV.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 ShallowCopyV.ShallowCopy(vtkDataObject) C++: void ShallowCopy(vtkDataObject *src) override; Shallow and Deep copy. DeepCopyV.DeepCopy(vtkDataObject) C++: void DeepCopy(vtkDataObject *src) override; Shallow and Deep copy. GetPointsOnFaceV.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) GetPointsOnParentFacesV.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) GetPointsOnEdgeV.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) GetPointsOnParentEdgeV.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 GetPointsOnEdge2DV.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) GetPointsOnParentEdge2DV.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 GetLeafDataV.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. SetDualGridFlagV.SetDualGridFlag(int) C++: void SetDualGridFlag(int flag) Switch between returning leaves as cells, or the dual grid. GetDualGridFlagV.GetDualGridFlag() -> int C++: virtual int GetDualGridFlag() Switch between returning leaves as cells, or the dual grid. GetActualMemorySizeV.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. GetDataV.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. vtkDataSetvtkDataObjectvtkObjectvtkObjectBasevtkHyperOctreeCursorvtkGenericCellERROR: In /Volumes/Data/workspace/med-macos-free/ExtProjs/VTK/Common/DataModel/vtkDataSet.h, line (): ijk indices are only valid with structured data! ErrorEventvtkIdListvtkCellvtkHyperOctreePointsGrabberV *vtkInformationV|i *vtkInformationVectorvtkInformationvtkInformationVectorvtkCommonDataModelPython.vtkHyperOctreeLightWeightCursorvtkHyperOctreeLightWeightCursor - no description provided. vtkHyperOctreeLightWeightCursor() vtkHyperOctreeLightWeightCursor( const &vtkHyperOctreeLightWeightCursor) this function takes no keyword argumentsV.Initialize(vtkHyperOctree) C++: void Initialize(vtkHyperOctree *tree) ToRootV.ToRoot() C++: void ToRoot() ToChildV.ToChild(int) C++: void ToChild(int child) GetIsLeafV.GetIsLeaf() -> int C++: unsigned short GetIsLeaf() GetLeafIndexV.GetLeafIndex() -> int C++: int GetLeafIndex() GetTreeV.GetTree() -> vtkHyperOctree C++: vtkHyperOctree *GetTree() GetLevelV.GetLevel() -> int C++: unsigned short GetLevel() @W vtkHyperOctreeLightWeightCursorOP `C0f@ff !:a@!!!a! a ! ! ! a a0 a !a`a@!aa`naaA0Caa `a"% XA\C0-!-!.ap/aP0 a`1a2Pa@4Pa5 a6 a7!P8a9!9!p:@:;!AC;<@=%p= =!AC >>a?!0@a@!A!B!B!zRx $aOAC $Da AC $laCAC $a0FC B$aAC B$bfAC E$ bfAC E$4 cfAC E$\hcAC G$ d:AC I$8eAC G$eAC G$fAC G$$ gAC I$LgAC G$tPhAC I$hAC G$`iAC G$iAC G$`jAC I$<jAC I$dpkAC I$kAC G$plAC E$hnAC I$oAC E$,pAC I$TqAC G$|rAC I$rAC I$8sAC E$0unAC E$xwAC I$DzAC I$l{AC I$|`AC I$AC G$AC G$ (AC I$4AC I$\ AC I$AC I$PAC I$PAC I$8 AC I$$ AC I$LAC G$tAC I$AC G$AC G$(@AC $AC E$<AC E$d%AC B$ AC $AC E$AC I$ @AC G$, AC I$T 0AC G$| AC G$ AC G$ xAC GzPLRx ,$PsAC I4T`y% AC P,ؑ;AC G,xAC CCR-Cv-BO-Bx-BB-Bv-jBO-LBx-"BAR-Av-AO-Ax-A`AR-VAv->AO-7A-Ax-@@v-@l=@O-@-@-n@x-D@@l=@v-?O-?-?x-??v-n?l=b?O-]?-L?w-???x->>k->v->g->u>-c>y-V>0>>m->-=u-==@-=g-==-=-=P-==Q==N-v=Y-a=U-S=-(=v-=-=O-<-<w-<<<-<O-|<-k<-K<w-><3<v-<;m-;-;-;-;-;-;n-;-;-;;-s;-k;_;-W;P;-G;@;-8;1;-&;-;;- ;-:-::-:-::-:-:u-::-:::9-X:T-Q:R-?:O-,:v-:O- :-9x-99R-9O-z9v-b9O-<9x-98v-8l=8O-8-8-8x-d818-'8v-8O-8-7x-77v-7l=v7O-q7-W7w-J7?7-.7-7w- 76x-66v-r6l=f6O-a6-G6w-:6/6-6-6w-55x-5q5v-Y5l=M5O-H5-%5w-5 5-4-4-4-4w-4~4x-T4!4v- 4l=3O-3-3w-33-3-3-3-h3w-[3.3x-32-2=2v-2l=2O-2-|2O-_2-62w-)22w-21-1}-1x-1p1=J1v-21l=&1O-!1-1w-00-0-0w-00x-d0?0l=30O-0v-/O-/-/w-//x-/_/l=S/O-2/v-/O-/-.w-..x-.z.R-m.O-[.v-C.O-<.-.x---l=-O--v--O---l-x-B--m---,-,S-,O-,-,O-q,-R,O-,s-,O-+-+O-u+-)S-)O-)-)O-)-)O-H)s-/)O-*)-)O-(-&=&-`&v-H&v-.&u-'&%|-%|-h%-P%-5%-%w-%$w-$$|-$z-m$q-L$x--$#|-#|-g#-O#-4#-#w-#"|-"z-"q-s"x-T""=!-!=!S-!=!O-!-!O-[!v-J!- !|- x-  = l= O-_ v-E O-@ -" w-  w--x-tl=hO-Gv--O-(- w--x-m-x-?l=/O-*r-O- t-O-l=O--v-mu-fZ-8~-%--{-q-x-O--]w-M>-x-R-O-v-rO-k-U-.x--O-l=O-O-gu-`RO-M-2w-%-x-O-L---x-Rx-<#O---x-u-hl=XO-S-7O-p-O-=u--k|-U-7x-!O---x-l=Fv-.l="O-- w-x-v-nl=bO-]-Lw-?x--v-O--|x-R%p-O-v-O-x-z-l=bl=VO-$=u-O-|-x-O- ---x-l=Ep-3O-v-O-x--=l=vO-D=;u-4&O-|-x-O-,---x-=aS-Wv-?O-7-x-  v- S- O- - -n x-D  v- S- O- - - x- n v-Y S-L O-D -5 - x-  S- O- v- O-| -\ x-2  S- v- O- - x- l S-_ O-L v-4 O-, - x-  v- l= O- - -^ x-4  R-v-O--x-ol=cO-Bv-(O-#- w-x-R-}O-kv-SO-L-,x-d-`-^--O-v-vO-b,x--O-v-O-}w-pR4R-O-v-o-----u->x-v-R-O-o----}-ub-2-O--v--O-|-uv-P%-O- -v-k-M-Z-}wi-rkd]Vk-QH=M-5.'Z-"j- \--Z-i-|ungV-IBZ-=6/j-'!\-  9  <x h @8 ( H   G   F   E   D   C x h B`  U?pPW8>h=[8xh7`XH6@8(5 43210xh/`XH.@8(- ,+*('xh&`XH%@8(# "! xh`XH@8( xh`XH@8( xh `XH @8(    @V8baf]XWeXc0_[@ `XP@ `@ `@ `@80 `@ `@ `@ `@  MC pEgPK0M0N'z@Qb o@/o? 6   d P 0 j 2]`@1` 3 0C $"} \C0--.p/^P0`12O@4567P899p:;(pN C<@=ip==> >j C>?0@@.ABPB` :B+ {" hO< u OV-c>TY  =  g 1T 3  #  a3 D y''SESB  z}| ' R  q:3    Z% ~(2^$_I7Nhk     _PyType_Ready__ZN13vtkPythonArgs11SetArgValueEix__ZN13vtkPythonArgs8GetValueERx__ZN14vtkHyperOctree13GetCellPointsExRxRPx__ZN14vtkHyperOctree8GetPointEx__ZN14vtkHyperOctree7GetCellEx__ZN14vtkHyperOctree11GetCellTypeEx_PyvtkDataSet_ClassNew_PyvtkHyperOctree_ClassNew_PyvtkHyperOctreeLightWeightCursor_TypeNew_PyVTKSpecialObject_New_PyVTKObject_New__ZL26PyvtkHyperOctree_StaticNewv__ZdlPv__ZN9vtkObject11InvokeEventEPKcPv__ZdaPv__ZN17vtkOStreamWrapperlsEPv__ZL39PyvtkHyperOctreeLightWeightCursor_CCopyPKv__ZN9vtkObject23GetGlobalWarningDisplayEv__ZN14vtkHyperOctree3NewEv__ZN31vtkHyperOctreeLightWeightCursor6ToRootEv__ZN14vtkHyperOctree17GetNumberOfPointsEv__ZN14vtkHyperOctree16GetNumberOfCellsEv__ZN14vtkHyperOctree17GetNumberOfLevelsEv__ZN14vtkHyperOctree17GetNumberOfLeavesEv__ZN20vtkOStrStreamWrapper3strEv__ZN14vtkHyperOctree13NewCellCursorEv__ZN9vtkObject12BreakOnErrorEv__ZN14vtkHyperOctree12GetDimensionEv__ZN20vtkOStrStreamWrapper5rdbufEv__ZN31vtkHyperOctreeLightWeightCursor9GetIsLeafEv__ZN14vtkHyperOctree10InitializeEv__ZN14vtkHyperOctree19GetActualMemorySizeEv__ZN14vtkHyperOctree14GetMaxCellSizeEv__ZN14vtkHyperOctree17GetDataObjectTypeEv__ZNK13vtkObjectBase12GetClassNameEv__ZN14vtkHyperOctree11GetLeafDataEv__ZN14vtkHyperOctree6LEVELSEv__ZN14vtkHyperOctree5SIZESEv__ZN14vtkHyperOctree9DIMENSIONEv__ZN20vtkOStrStreamWrapperD1Ev__ZN31vtkHyperOctreeLightWeightCursorC1Ev__ZN20vtkOStrStreamWrapperC1Ev__ZN14vtkHyperOctree13GetCellPointsExP9vtkIdList__ZN14vtkHyperOctree13GetPointCellsExP9vtkIdList_PyVTKObject_GetSet__ZN14vtkHyperOctree13CopyStructureEP10vtkDataSet__Py_NoneStruct__ZL38PyvtkHyperOctreeLightWeightCursor_HashP7_object__ZL40PyvtkHyperOctreeLightWeightCursor_DeleteP7_object__ZN13vtkPythonArgs21GetArgAsSpecialObjectEPKcPP7_object_PyVTKObject_GetObject__ZN14vtkHyperOctree11ShallowCopyEP13vtkDataObject__ZN14vtkHyperOctree8DeepCopyEP13vtkDataObject__ZL41PyvtkHyperOctreeLightWeightCursor_Methods__ZL73PyvtkHyperOctreeLightWeightCursor_vtkHyperOctreeLightWeightCursor_Methods__ZL24PyvtkHyperOctree_Methods__ZL32PyvtkHyperOctree_GetData_Methods_PyObject_GenericSetAttr_PyObject_GenericGetAttr_PyVTKSpecialObject_Repr_PyVTKObject_Repr__ZN14vtkHyperOctree13SubdivideLeafEP20vtkHyperOctreeCursor__ZN14vtkHyperOctree20CollapseTerminalNodeEP20vtkHyperOctreeCursor_PyExc_TypeError_PyVTKObject_AsBuffer__ZN14vtkHyperOctree22GetPointsOnParentFacesEPiiP20vtkHyperOctreeCursorP27vtkHyperOctreePointsGrabber__ZN14vtkHyperOctree15GetPointsOnFaceEP20vtkHyperOctreeCursoriiP27vtkHyperOctreePointsGrabber__ZN14vtkHyperOctree23GetPointsOnParentEdge2DEP20vtkHyperOctreeCursoriiP27vtkHyperOctreePointsGrabber__ZN14vtkHyperOctree17GetPointsOnEdge2DEP20vtkHyperOctreeCursoriiP27vtkHyperOctreePointsGrabber__ZN14vtkHyperOctree21GetPointsOnParentEdgeEP20vtkHyperOctreeCursoriiiiP27vtkHyperOctreePointsGrabber__ZN14vtkHyperOctree15GetPointsOnEdgeEP20vtkHyperOctreeCursoriiiiP27vtkHyperOctreePointsGrabber_strcmp__ZN14vtkHyperOctree7GetDataEP14vtkInformation__Znwm__ZN14vtkHyperOctree7GetCellExP14vtkGenericCell___stack_chk_fail_PyObject_GC_Del__ZN13vtkPythonArgs5ArrayIxEC1El__ZN13vtkPythonArgs5ArrayIdEC1El_PyVTKObject_Check__ZN13vtkPythonArgs8GetArrayEPxi__ZN13vtkPythonArgs11SetArgValueEiPKxi__ZN14vtkHyperOctree7GetDataEP20vtkInformationVectori__ZN10vtkDataSet7GetCellEiii__ZN13vtkPythonArgs8GetArrayEPii__ZN13vtkPythonArgs8SetArrayEiPKii__ZN13vtkPythonArgs13ArgCountErrorEii__ZN13vtkPythonArgs11SetArgValueEii__ZN13vtkPythonArgs8GetArrayEPdi__ZN13vtkPythonArgs8SetArrayEiPKdi__ZN13vtkPythonArgs10BuildTupleEPKdi__ZN13vtkPythonArgs8GetValueERi__ZN14vtkHyperOctree30GetMaxNumberOfPointsOnBoundaryEi__ZN14vtkHyperOctree29GetMaxNumberOfCellsOnBoundaryEi__ZN14vtkHyperOctree20GetMaxNumberOfPointsEi__ZN17vtkOStreamWrapperlsEi__ZN14vtkHyperOctree12SetDimensionEi__ZN14vtkHyperOctree15SetDualGridFlagEi__ZN13vtkPythonArgs10GetArgSizeEi__ZN20vtkOStrStreamWrapper6freezeEi__ZN31vtkHyperOctreeLightWeightCursor7ToChildEi_PyLong_FromLong_PyLong_FromLongLong_PyLong_FromUnsignedLong_PyErr_SetString_PyDict_SetItemString_PyVTKObject_String_PyVTKObject_SetFlag_PyDict_Size_PyVTKObject_Delete_PyVTKObject_Traverse__ZN13vtkPythonUtil20GetObjectFromPointerEP13vtkObjectBase__ZL38PyvtkHyperOctreeLightWeightCursor_Type_PyType_Type__ZL21PyvtkHyperOctree_Type__Unwind_Resume_PyVTKAddFile_vtkHyperOctree__ZN31vtkHyperOctreeLightWeightCursor10InitializeEP14vtkHyperOctree_PyObject_Free___stack_chk_guard_PyObject_HashNotImplemented_PyErr_Occurred_PyVTKClass_Add_PyVTKSpecialType_Add__ZN13vtkPythonArgs8GetValueERd__ZN14vtkHyperOctree8GetPointExPd__ZN14vtkHyperOctree9FindPointEPd__Py_Dealloc__ZN13vtkPythonArgs8GetValueERPc__Z31vtkOutputWindowDisplayErrorTextPKc__ZN13vtkPythonArgs13ArgCountErrorEiPKc__ZN17vtkOStreamWrapperlsEPKc__ZN9vtkObject11HasObserverEPKc__ZN13vtkObjectBase8IsTypeOfEPKc__ZN13vtkPythonArgs17GetArgAsVTKObjectEPKcRb__ZN17vtkPythonOverload10CallMethodEP11PyMethodDefP7_objectS3___ZL37PyvtkHyperOctreeLightWeightCursor_NewP11_typeobjectP7_objectS2___ZN14vtkHyperOctree16GetCellNeighborsExP9vtkIdListS1___ZN13vtkPythonArgs19GetSelfFromFirstArgEP7_objectS1___ZL47PyvtkHyperOctree_GetMaxNumberOfPointsOnBoundaryP7_objectS0___ZL46PyvtkHyperOctree_GetMaxNumberOfCellsOnBoundaryP7_objectS0___ZL28PyvtkHyperOctree_ShallowCopyP7_objectS0___ZL25PyvtkHyperOctree_DeepCopyP7_objectS0___ZL46PyvtkHyperOctreeLightWeightCursor_GetLeafIndexP7_objectS0___ZL29PyvtkHyperOctree_SafeDownCastP7_objectS0___ZL40PyvtkHyperOctreeLightWeightCursor_ToRootP7_objectS0___ZL25PyvtkHyperOctree_GetPointP7_objectS0___ZL26PyvtkHyperOctree_FindPointP7_objectS0___ZL30PyvtkHyperOctree_GetCellPointsP7_objectS0___ZL37PyvtkHyperOctree_GetMaxNumberOfPointsP7_objectS0___ZL34PyvtkHyperOctree_GetNumberOfPointsP7_objectS0___ZL33PyvtkHyperOctree_GetCellNeighborsP7_objectS0___ZL30PyvtkHyperOctree_GetPointCellsP7_objectS0___ZL33PyvtkHyperOctree_GetNumberOfCellsP7_objectS0___ZL34PyvtkHyperOctree_GetNumberOfLevelsP7_objectS0___ZL34PyvtkHyperOctree_GetNumberOfLeavesP7_objectS0___ZL39PyvtkHyperOctree_GetPointsOnParentFacesP7_objectS0___ZL30PyvtkHyperOctree_NewCellCursorP7_objectS0___ZL29PyvtkHyperOctree_SetDimensionP7_objectS0___ZL29PyvtkHyperOctree_GetDimensionP7_objectS0___ZL26PyvtkHyperOctree_SetOriginP7_objectS0___ZL26PyvtkHyperOctree_GetOriginP7_objectS0___ZL24PyvtkHyperOctree_GetCellP7_objectS0___ZL25PyvtkHyperOctree_FindCellP7_objectS0___ZL42PyvtkHyperOctreeLightWeightCursor_GetLevelP7_objectS0___ZL32PyvtkHyperOctree_SetDualGridFlagP7_objectS0___ZL32PyvtkHyperOctree_GetDualGridFlagP7_objectS0___ZL43PyvtkHyperOctreeLightWeightCursor_GetIsLeafP7_objectS0___ZL30PyvtkHyperOctree_SubdivideLeafP7_objectS0___ZL25PyvtkHyperOctree_IsTypeOfP7_objectS0___ZL44PyvtkHyperOctreeLightWeightCursor_InitializeP7_objectS0___ZL27PyvtkHyperOctree_InitializeP7_objectS0___ZL36PyvtkHyperOctree_GetActualMemorySizeP7_objectS0___ZL24PyvtkHyperOctree_SetSizeP7_objectS0___ZL24PyvtkHyperOctree_GetSizeP7_objectS0___ZL31PyvtkHyperOctree_GetMaxCellSizeP7_objectS0___ZL30PyvtkHyperOctree_CopyStructureP7_objectS0___ZL34PyvtkHyperOctree_GetDataObjectTypeP7_objectS0___ZL28PyvtkHyperOctree_GetCellTypeP7_objectS0___ZL38PyvtkHyperOctree_GetPointsOnParentEdgeP7_objectS0___ZL32PyvtkHyperOctree_GetPointsOnEdgeP7_objectS0___ZL41PyvtkHyperOctreeLightWeightCursor_GetTreeP7_objectS0___ZL37PyvtkHyperOctree_CollapseTerminalNodeP7_objectS0___ZL28PyvtkHyperOctree_NewInstanceP7_objectS0___ZL32PyvtkHyperOctree_GetPointsOnFaceP7_objectS0___ZL41PyvtkHyperOctreeLightWeightCursor_ToChildP7_objectS0___ZL24PyvtkHyperOctree_GetDataP7_objectS0___ZL28PyvtkHyperOctree_GetLeafDataP7_objectS0___ZL23PyvtkHyperOctree_LEVELSP7_objectS0___ZL22PyvtkHyperOctree_SIZESP7_objectS0___ZL26PyvtkHyperOctree_DIMENSIONP7_objectS0___ZL40PyvtkHyperOctree_GetPointsOnParentEdge2DP7_objectS0___ZL34PyvtkHyperOctree_GetPointsOnEdge2DP7_objectS0___ZL20PyvtkHyperOctree_IsAP7_objectS0___ZL68PyvtkHyperOctreeLightWeightCursor_vtkHyperOctreeLightWeightCursor_s2P7_objectS0___ZL27PyvtkHyperOctree_GetData_s2P7_objectS0___ZL27PyvtkHyperOctree_GetData_s1P7_objectS0___ZN14vtkHyperOctree8FindCellEPdP7vtkCellxdRiS0_S0___ZN14vtkHyperOctree8FindCellEPdP7vtkCellP14vtkGenericCellxdRiS0_S0_GCC_except_table58GCC_except_table37GCC_except_table53GCC_except_table33___gxx_personality_v0