<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>VTK: dox/Filtering/vtkHyperOctree.h Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.6 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="classes.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<h1>dox/Filtering/vtkHyperOctree.h</h1><a href="a02272.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*=========================================================================</span>
<a name="l00002"></a>00002 <span class="comment"></span>
<a name="l00003"></a>00003 <span class="comment"> Program: Visualization Toolkit</span>
<a name="l00004"></a>00004 <span class="comment"> Module: $RCSfile: vtkHyperOctree.h,v $</span>
<a name="l00005"></a>00005 <span class="comment"></span>
<a name="l00006"></a>00006 <span class="comment"> Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen</span>
<a name="l00007"></a>00007 <span class="comment"> All rights reserved.</span>
<a name="l00008"></a>00008 <span class="comment"> See Copyright.txt or http://www.kitware.com/Copyright.htm for details.</span>
<a name="l00009"></a>00009 <span class="comment"></span>
<a name="l00010"></a>00010 <span class="comment"> This software is distributed WITHOUT ANY WARRANTY; without even</span>
<a name="l00011"></a>00011 <span class="comment"> the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR</span>
<a name="l00012"></a>00012 <span class="comment"> PURPOSE. See the above copyright notice for more information.</span>
<a name="l00013"></a>00013 <span class="comment"></span>
<a name="l00014"></a>00014 <span class="comment">=========================================================================*/</span>
<a name="l00114"></a>00114 <span class="preprocessor">#ifndef __vtkHyperOctree_h</span>
<a name="l00115"></a>00115 <span class="preprocessor"></span><span class="preprocessor">#define __vtkHyperOctree_h</span>
<a name="l00116"></a>00116 <span class="preprocessor"></span>
<a name="l00117"></a>00117 <span class="preprocessor">#include "<a class="code" href="a02226.html">vtkDataSet.h</a>"</span>
<a name="l00118"></a>00118
<a name="l00119"></a>00119 <span class="keyword">class </span><a class="code" href="a00708.html">vtkHyperOctreeLightWeightCursor</a>;
<a name="l00120"></a>00120 <span class="keyword">class </span><a class="code" href="a00703.html" title="Objects that can traverse hyperoctree nodes.">vtkHyperOctreeCursor</a>;
<a name="l00121"></a>00121 <span class="keyword">class </span>vtkHyperOctreeInternal;
<a name="l00122"></a>00122 <span class="keyword">class </span><a class="code" href="a00710.html" title="An object used by filters to store points computed on face or edge of an hyperoctant...">vtkHyperOctreePointsGrabber</a>;
<a name="l00123"></a>00123
<a name="l00124"></a>00124 <span class="keyword">class </span>vtkHyperOctreeIdSet; <span class="comment">// Pimpl idiom</span>
<a name="l00125"></a>00125 <span class="keyword">class </span><a class="code" href="a01278.html" title="a cell that represents an n-sided polygon">vtkPolygon</a>;
<a name="l00126"></a>00126 <span class="keyword">class </span><a class="code" href="a00722.html" title="dynamic, self-adjusting array of vtkIdType">vtkIdTypeArray</a>;
<a name="l00127"></a>00127 <span class="keyword">class </span><a class="code" href="a01250.html" title="represent and manipulate 3D points">vtkPoints</a>;
<a name="l00128"></a>00128 <span class="keyword">class </span><a class="code" href="a01247.html" title="quickly locate points in 3-space">vtkPointLocator</a>;
<a name="l00129"></a>00129 <span class="keyword">class </span><a class="code" href="a01128.html" title="helper class to generate triangulations">vtkOrderedTriangulator</a>;
<a name="l00130"></a>00130 <span class="keyword">class </span><a class="code" href="a00376.html" title="represent and manipulate attribute data in a dataset">vtkDataSetAttributes</a>;
<a name="l00131"></a>00131
<a name="l00132"></a>00132 <span class="keyword">class </span><a class="code" href="a00960.html" title="cell represents a 1D line">vtkLine</a>;
<a name="l00133"></a>00133 <span class="keyword">class </span><a class="code" href="a01221.html" title="a cell that represents an orthogonal quadrilateral">vtkPixel</a>;
<a name="l00134"></a>00134 <span class="keyword">class </span><a class="code" href="a01859.html" title="a cell that represents a 3D orthogonal parallelepiped">vtkVoxel</a>;
<a name="l00135"></a>00135 <span class="keyword">class </span><a class="code" href="a00248.html" title="object represents upward pointers from points to list of cells using each point">vtkCellLinks</a>;
<a name="l00136"></a>00136
<a name="l00137"></a><a class="code" href="a00699.html">00137</a> <span class="keyword">class </span><a class="code" href="a02170.html#95ced7977a6b6b1bf9f38bf04e3835b6">VTK_FILTERING_EXPORT</a> <a class="code" href="a00699.html" title="A dataset structured as a tree where each node has exactly 2^n children.">vtkHyperOctree</a> : <span class="keyword">public</span> <a class="code" href="a00374.html" title="abstract class to specify dataset behavior">vtkDataSet</a>
<a name="l00138"></a>00138 {
<a name="l00139"></a>00139 <span class="keyword">public</span>:
<a name="l00140"></a>00140 <span class="keyword">static</span> <a class="code" href="a00881.html" title="Key for integer values in vtkInformation.">vtkInformationIntegerKey</a>* LEVELS();
<a name="l00141"></a>00141 <span class="keyword">static</span> <a class="code" href="a00881.html" title="Key for integer values in vtkInformation.">vtkInformationIntegerKey</a>* DIMENSION();
<a name="l00142"></a>00142 <span class="keyword">static</span> <a class="code" href="a00875.html" title="Key for double vector values.">vtkInformationDoubleVectorKey</a>* SIZES();
<a name="l00143"></a>00143 <span class="keyword">static</span> <a class="code" href="a00699.html" title="A dataset structured as a tree where each node has exactly 2^n children.">vtkHyperOctree</a> *<a class="code" href="a00362.html#13d4f201619a19a9b39978e92239cd98">New</a>();
<a name="l00144"></a>00144
<a name="l00145"></a><a class="code" href="a00699.html#69f478bc7e2b2718a4fa6458bfde9573">00145</a> vtkTypeRevisionMacro(<a class="code" href="a00699.html" title="A dataset structured as a tree where each node has exactly 2^n children.">vtkHyperOctree</a>,<a class="code" href="a00374.html" title="abstract class to specify dataset behavior">vtkDataSet</a>);
<a name="l00146"></a>00146 <span class="keywordtype">void</span> <a class="code" href="a00374.html#8888a27602c40c1fecb773126bb4a30f">PrintSelf</a>(ostream& os, <a class="code" href="a00869.html" title="a simple class to control print indentation">vtkIndent</a> indent);
<a name="l00147"></a>00147
<a name="l00149"></a>00149 <span class="keywordtype">int</span> <a class="code" href="a00374.html#40c6592489f97ca77ecd5c4abbbbe7b9">GetDataObjectType</a>();
<a name="l00150"></a>00150
<a name="l00153"></a>00153 <span class="keywordtype">void</span> <a class="code" href="a00374.html#a257bc67d26310ad0d6bef97c066c099">CopyStructure</a>(<a class="code" href="a00374.html" title="abstract class to specify dataset behavior">vtkDataSet</a> *ds);
<a name="l00154"></a>00154
<a name="l00155"></a>00155 <span class="comment">// Return the node describes by the path from the root.</span>
<a name="l00156"></a>00156 <span class="comment">// Path is a sequence of number between 0 and 7.</span>
<a name="l00157"></a>00157 <span class="comment">// \pre path_exists: path!=0</span>
<a name="l00158"></a>00158 <span class="comment">// \pre node_exists: IsANode(path)</span>
<a name="l00159"></a>00159 <span class="comment">// vtkOctree *GetNode(vtkPath *path);</span>
<a name="l00160"></a>00160
<a name="l00161"></a>00161 <span class="comment">// Status</span>
<a name="l00162"></a>00162 <span class="comment">// Return the dimension of the tree (1D:binary tree(2 children), 2D:quadtree(4 children),</span>
<a name="l00163"></a>00163 <span class="comment">// 3D:octree (8 children))</span>
<a name="l00164"></a>00164 <span class="comment">// \post valid_result: result>=1 && result<=3</span>
<a name="l00165"></a>00165 <span class="keywordtype">int</span> GetDimension();
<a name="l00166"></a>00166
<a name="l00167"></a>00167 <span class="comment">// Set the dimension of the tree with `dim'. See GetDimension() for details.</span>
<a name="l00168"></a>00168 <span class="comment">// \pre valid_dim: dim>=1 && dim<=3</span>
<a name="l00169"></a>00169 <span class="comment">// \post dimension_is_set: GetDimension()==dim</span>
<a name="l00170"></a>00170 <span class="keywordtype">void</span> SetDimension(<span class="keywordtype">int</span> dim);
<a name="l00171"></a>00171
<a name="l00172"></a>00172 <span class="comment">// Return if the node for the given path exists or not.</span>
<a name="l00173"></a>00173 <span class="comment">// \pre path_exists: path!=0</span>
<a name="l00174"></a>00174 <span class="comment">// int IsANode(vtkPath *path);</span>
<a name="l00175"></a>00175
<a name="l00176"></a>00176 <span class="comment">// Return if the node for the given path is a leaf or not.</span>
<a name="l00177"></a>00177 <span class="comment">// \pre path_exists: path!=0</span>
<a name="l00178"></a>00178 <span class="comment">// \pre node_exists: IsANode(path)</span>
<a name="l00179"></a>00179 <span class="comment">// int IsALeaf(vtkPath *path);</span>
<a name="l00180"></a>00180
<a name="l00181"></a>00181 <span class="comment">// Measurement: topology</span>
<a name="l00182"></a>00182
<a name="l00185"></a>00185 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> <a class="code" href="a00374.html#71c110da748f73e5c5f5c42a33805460">GetNumberOfCells</a>();
<a name="l00186"></a>00186
<a name="l00188"></a>00188 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> GetNumberOfLeaves();
<a name="l00189"></a>00189
<a name="l00192"></a>00192 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> <a class="code" href="a00374.html#61b3ec9367dcb1be34a93026e92c2cab">GetNumberOfPoints</a>();
<a name="l00193"></a>00193
<a name="l00200"></a>00200 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> GetMaxNumberOfPoints(<span class="keywordtype">int</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2103f20abad13593a5879a08c3e64355835">level</a>);
<a name="l00201"></a>00201
<a name="l00212"></a>00212 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> GetMaxNumberOfPointsOnBoundary(<span class="keywordtype">int</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2103f20abad13593a5879a08c3e64355835">level</a>);
<a name="l00213"></a>00213
<a name="l00218"></a>00218 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> GetMaxNumberOfCellsOnBoundary(<span class="keywordtype">int</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2103f20abad13593a5879a08c3e64355835">level</a>);
<a name="l00219"></a>00219
<a name="l00222"></a>00222 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> GetNumberOfLevels();
<a name="l00223"></a>00223
<a name="l00224"></a>00224 <span class="comment">// Measurement: geometry</span>
<a name="l00225"></a>00225
<a name="l00227"></a>00227
<a name="l00228"></a>00228 vtkSetVector3Macro(Size,<span class="keywordtype">double</span>);
<a name="l00230"></a>00230
<a name="l00232"></a>00232
<a name="l00233"></a>00233 vtkGetVector3Macro(Size,<span class="keywordtype">double</span>);
<a name="l00235"></a>00235
<a name="l00237"></a>00237
<a name="l00238"></a>00238 vtkSetVector3Macro(Origin,<span class="keywordtype">double</span>);
<a name="l00239"></a>00239 <span class="comment">// Return the origin (position of corner (0,0,0) ) of the root.</span>
<a name="l00240"></a>00240 vtkGetVector3Macro(Origin,<span class="keywordtype">double</span>);
<a name="l00242"></a>00242
<a name="l00245"></a>00245 <a class="code" href="a00703.html" title="Objects that can traverse hyperoctree nodes.">vtkHyperOctreeCursor</a> *NewCellCursor();
<a name="l00246"></a>00246
<a name="l00250"></a>00250 <span class="keywordtype">void</span> SubdivideLeaf(<a class="code" href="a00703.html" title="Objects that can traverse hyperoctree nodes.">vtkHyperOctreeCursor</a> *leaf);
<a name="l00251"></a>00251
<a name="l00256"></a>00256 <span class="keywordtype">void</span> CollapseTerminalNode(<a class="code" href="a00703.html" title="Objects that can traverse hyperoctree nodes.">vtkHyperOctreeCursor</a> *node);
<a name="l00257"></a>00257
<a name="l00260"></a>00260 <span class="keyword">virtual</span> <span class="keywordtype">double</span> *<a class="code" href="a00374.html#e8406fa1dc144b392ef28111c71a47b0">GetPoint</a>(<a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> ptId);
<a name="l00261"></a>00261
<a name="l00265"></a>00265 <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="a00374.html#e8406fa1dc144b392ef28111c71a47b0">GetPoint</a>(<a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> <span class="keywordtype">id</span>, <span class="keywordtype">double</span> x[3]);
<a name="l00266"></a>00266
<a name="l00269"></a>00269 <span class="keyword">virtual</span> <a class="code" href="a00240.html" title="abstract class to specify cell behavior">vtkCell</a> *<a class="code" href="a00374.html#711ed1ebb7bdf4a4e2ed6896081cd1b2">GetCell</a>(<a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> cellId);
<a name="l00270"></a>00270
<a name="l00275"></a>00275 <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="a00374.html#711ed1ebb7bdf4a4e2ed6896081cd1b2">GetCell</a>(<a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> cellId, <a class="code" href="a00582.html" title="provides thread-safe access to cells">vtkGenericCell</a> *cell);
<a name="l00276"></a>00276
<a name="l00277"></a>00277
<a name="l00281"></a>00281 <span class="keyword">virtual</span> <span class="keywordtype">int</span> <a class="code" href="a00374.html#b28fa53d04647bf06d549b5b7c331462">GetCellType</a>(<a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> cellId);
<a name="l00282"></a>00282
<a name="l00284"></a>00284
<a name="l00287"></a>00287 <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="a00374.html#b4d677c257a58e4eb4a80757f9b371ea">GetCellPoints</a>(<a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> cellId, <a class="code" href="a00720.html" title="list of point or cell ids">vtkIdList</a> *ptIds);
<a name="l00288"></a>00288 <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="a00374.html#b4d677c257a58e4eb4a80757f9b371ea">GetCellPoints</a>(<a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> cellId, <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a>& npts,
<a name="l00289"></a>00289 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a>* &pts);
<a name="l00291"></a>00291
<a name="l00295"></a>00295 <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="a00374.html#36d1d8f67ad67adf4d1a9cfb30dade49">GetPointCells</a>(<a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> ptId, <a class="code" href="a00720.html" title="list of point or cell ids">vtkIdList</a> *cellIds);
<a name="l00296"></a>00296
<a name="l00297"></a>00297
<a name="l00299"></a>00299
<a name="l00303"></a>00303 <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="a00374.html#e1ba413c15802ef50d9b1955a66521e4">GetCellNeighbors</a>(<a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> cellId, <a class="code" href="a00720.html" title="list of point or cell ids">vtkIdList</a> *ptIds,
<a name="l00304"></a>00304 <a class="code" href="a00720.html" title="list of point or cell ids">vtkIdList</a> *cellIds);
<a name="l00306"></a>00306
<a name="l00307"></a>00307 <span class="keyword">virtual</span> <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> <a class="code" href="a00374.html#d01fb4f295210a2c707801cb7c3da5ce">FindPoint</a>(<span class="keywordtype">double</span> x[3]);
<a name="l00308"></a>00308
<a name="l00310"></a>00310
<a name="l00318"></a>00318 <span class="keyword">virtual</span> <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> <a class="code" href="a00374.html#2221c10d3c4cca44e82c5ef70e4e1cbd">FindCell</a>(<span class="keywordtype">double</span> x[3], <a class="code" href="a00240.html" title="abstract class to specify cell behavior">vtkCell</a> *cell, <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> cellId,
<a name="l00319"></a>00319 <span class="keywordtype">double</span> tol2, <span class="keywordtype">int</span>& subId, <span class="keywordtype">double</span> pcoords[3],
<a name="l00320"></a>00320 <span class="keywordtype">double</span> *weights);
<a name="l00322"></a>00322
<a name="l00324"></a>00324
<a name="l00329"></a>00329 <span class="keyword">virtual</span> <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> <a class="code" href="a00374.html#2221c10d3c4cca44e82c5ef70e4e1cbd">FindCell</a>(<span class="keywordtype">double</span> x[3], <a class="code" href="a00240.html" title="abstract class to specify cell behavior">vtkCell</a> *cell,
<a name="l00330"></a>00330 <a class="code" href="a00582.html" title="provides thread-safe access to cells">vtkGenericCell</a> *gencell, <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> cellId,
<a name="l00331"></a>00331 <span class="keywordtype">double</span> tol2, <span class="keywordtype">int</span>& subId, <span class="keywordtype">double</span> pcoords[3],
<a name="l00332"></a>00332 <span class="keywordtype">double</span> *weights);
<a name="l00334"></a>00334
<a name="l00336"></a>00336 <span class="keywordtype">void</span> <a class="code" href="a00374.html#39cf7f4c5af1f2eb0bf92a44adc0b6b3">Initialize</a>();
<a name="l00337"></a>00337
<a name="l00341"></a>00341 <span class="keyword">virtual</span> <span class="keywordtype">int</span> <a class="code" href="a00374.html#e0749b27b9429010617f21932a1313fd">GetMaxCellSize</a>();
<a name="l00342"></a>00342
<a name="l00344"></a>00344
<a name="l00345"></a>00345 <span class="keywordtype">void</span> <a class="code" href="a00374.html#e4a9b08662d920f454501a36f71ad1a5">ShallowCopy</a>(<a class="code" href="a00362.html" title="general representation of visualization data">vtkDataObject</a> *src);
<a name="l00346"></a>00346 <span class="keywordtype">void</span> <a class="code" href="a00374.html#ded3bdeaa9acf491b4c2fb0be9be298d">DeepCopy</a>(<a class="code" href="a00362.html" title="general representation of visualization data">vtkDataObject</a> *src);
<a name="l00348"></a>00348
<a name="l00350"></a>00350
<a name="l00355"></a>00355 <span class="keywordtype">void</span> GetPointsOnFace(<a class="code" href="a00703.html" title="Objects that can traverse hyperoctree nodes.">vtkHyperOctreeCursor</a> *sibling,
<a name="l00356"></a>00356 <span class="keywordtype">int</span> <a class="code" href="a00012.html">face</a>,
<a name="l00357"></a>00357 <span class="keywordtype">int</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2103f20abad13593a5879a08c3e64355835">level</a>,
<a name="l00358"></a>00358 <a class="code" href="a00710.html" title="An object used by filters to store points computed on face or edge of an hyperoctant...">vtkHyperOctreePointsGrabber</a> *grabber);
<a name="l00360"></a>00360
<a name="l00362"></a>00362
<a name="l00367"></a>00367 <span class="keywordtype">void</span> GetPointsOnParentFaces(<span class="keywordtype">int</span> faces[3],
<a name="l00368"></a>00368 <span class="keywordtype">int</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2103f20abad13593a5879a08c3e64355835">level</a>,
<a name="l00369"></a>00369 <a class="code" href="a00703.html" title="Objects that can traverse hyperoctree nodes.">vtkHyperOctreeCursor</a> *cursor,
<a name="l00370"></a>00370 <a class="code" href="a00710.html" title="An object used by filters to store points computed on face or edge of an hyperoctant...">vtkHyperOctreePointsGrabber</a> *grabber);
<a name="l00372"></a>00372
<a name="l00374"></a>00374
<a name="l00385"></a>00385 <span class="keywordtype">void</span> GetPointsOnEdge(<a class="code" href="a00703.html" title="Objects that can traverse hyperoctree nodes.">vtkHyperOctreeCursor</a> *sibling,
<a name="l00386"></a>00386 <span class="keywordtype">int</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2103f20abad13593a5879a08c3e64355835">level</a>,
<a name="l00387"></a>00387 <span class="keywordtype">int</span> axis,
<a name="l00388"></a>00388 <span class="keywordtype">int</span> k,
<a name="l00389"></a>00389 <span class="keywordtype">int</span> j,
<a name="l00390"></a>00390 <a class="code" href="a00710.html" title="An object used by filters to store points computed on face or edge of an hyperoctant...">vtkHyperOctreePointsGrabber</a> *grabber);
<a name="l00392"></a>00392
<a name="l00394"></a>00394
<a name="l00403"></a>00403 <span class="keywordtype">void</span> GetPointsOnParentEdge(<a class="code" href="a00703.html" title="Objects that can traverse hyperoctree nodes.">vtkHyperOctreeCursor</a> *cursor,
<a name="l00404"></a>00404 <span class="keywordtype">int</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2103f20abad13593a5879a08c3e64355835">level</a>,
<a name="l00405"></a>00405 <span class="keywordtype">int</span> axis,
<a name="l00406"></a>00406 <span class="keywordtype">int</span> k,
<a name="l00407"></a>00407 <span class="keywordtype">int</span> j,
<a name="l00408"></a>00408 <a class="code" href="a00710.html" title="An object used by filters to store points computed on face or edge of an hyperoctant...">vtkHyperOctreePointsGrabber</a> *grabber);
<a name="l00410"></a>00410
<a name="l00412"></a>00412
<a name="l00417"></a>00417 <span class="keywordtype">void</span> GetPointsOnEdge2D(<a class="code" href="a00703.html" title="Objects that can traverse hyperoctree nodes.">vtkHyperOctreeCursor</a> *sibling,
<a name="l00418"></a>00418 <span class="keywordtype">int</span> edge,
<a name="l00419"></a>00419 <span class="keywordtype">int</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2103f20abad13593a5879a08c3e64355835">level</a>,
<a name="l00420"></a>00420 <a class="code" href="a00710.html" title="An object used by filters to store points computed on face or edge of an hyperoctant...">vtkHyperOctreePointsGrabber</a> *grabber);
<a name="l00422"></a>00422
<a name="l00424"></a>00424
<a name="l00429"></a>00429 <span class="keywordtype">void</span> GetPointsOnParentEdge2D(<a class="code" href="a00703.html" title="Objects that can traverse hyperoctree nodes.">vtkHyperOctreeCursor</a> *cursor,
<a name="l00430"></a>00430 <span class="keywordtype">int</span> edge,
<a name="l00431"></a>00431 <span class="keywordtype">int</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2103f20abad13593a5879a08c3e64355835">level</a>,
<a name="l00432"></a>00432 <a class="code" href="a00710.html" title="An object used by filters to store points computed on face or edge of an hyperoctant...">vtkHyperOctreePointsGrabber</a> *grabber);
<a name="l00434"></a>00434
<a name="l00437"></a>00437 <a class="code" href="a00376.html" title="represent and manipulate attribute data in a dataset">vtkDataSetAttributes</a>* GetLeafData();
<a name="l00438"></a>00438
<a name="l00440"></a>00440
<a name="l00441"></a>00441 <span class="keywordtype">void</span> SetDualGridFlag(<span class="keywordtype">int</span> flag);
<a name="l00442"></a>00442 vtkGetMacro(DualGridFlag,<span class="keywordtype">int</span>);
<a name="l00444"></a>00444
<a name="l00450"></a>00450 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <a class="code" href="a00374.html#ee582232dad64e0c3abb88ddc1b1a3c8">GetActualMemorySize</a>();
<a name="l00451"></a>00451
<a name="l00452"></a>00452 <span class="comment">//BTX</span>
<a name="l00454"></a>00454 <span class="comment"></span>
<a name="l00455"></a>00455 <span class="keyword">static</span> <a class="code" href="a00699.html" title="A dataset structured as a tree where each node has exactly 2^n children.">vtkHyperOctree</a>* <a class="code" href="a00374.html#1f2fa3ed6b77868bf5a814b0dafd3706">GetData</a>(<a class="code" href="a00872.html" title="Store vtkAlgorithm input/output information.">vtkInformation</a>* <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d21023da246d4a744e861548382bb79fad81">info</a>);
<a name="l00456"></a>00456 <span class="keyword">static</span> <a class="code" href="a00699.html" title="A dataset structured as a tree where each node has exactly 2^n children.">vtkHyperOctree</a>* <a class="code" href="a00374.html#1f2fa3ed6b77868bf5a814b0dafd3706">GetData</a>(<a class="code" href="a00895.html" title="Store zero or more vtkInformation instances.">vtkInformationVector</a>* v, <span class="keywordtype">int</span> i=0);
<a name="l00457"></a>00457 <span class="comment">//ETX</span>
<a name="l00459"></a>00459 <span class="comment"></span>
<a name="l00460"></a>00460 <span class="keyword">protected</span>:
<a name="l00461"></a>00461 <span class="comment">// Constructor with default bounds (0,1, 0,1, 0,1).</span>
<a name="l00462"></a>00462 <a class="code" href="a00699.html" title="A dataset structured as a tree where each node has exactly 2^n children.">vtkHyperOctree</a>();
<a name="l00463"></a>00463 ~<a class="code" href="a00699.html" title="A dataset structured as a tree where each node has exactly 2^n children.">vtkHyperOctree</a>();
<a name="l00464"></a>00464
<a name="l00465"></a>00465 <span class="keywordtype">void</span> <a class="code" href="a00374.html#261a4f32cd2f8ff336c2d85cc33d21ae">ComputeBounds</a>();
<a name="l00466"></a>00466
<a name="l00467"></a><a class="code" href="a00699.html#c0b25344d1ec02724e13c83e227f531d">00467</a> <span class="keywordtype">int</span> Dimension; <span class="comment">// 1, 2 or 3.</span>
<a name="l00468"></a>00468
<a name="l00469"></a><a class="code" href="a00699.html#2131617cb1636621c357afb0908c4d27">00469</a> <span class="keywordtype">double</span> Size[3]; <span class="comment">// size on each axis</span>
<a name="l00470"></a><a class="code" href="a00699.html#4a5f6d6449e6519ea5067c0818ced1a0">00470</a> <span class="keywordtype">double</span> Origin[3]; <span class="comment">// position of corner (0,0,0) of the root.</span>
<a name="l00471"></a>00471
<a name="l00472"></a><a class="code" href="a00699.html#f76c37ef81bd9e01205768e85cfdd4cd">00472</a> vtkHyperOctreeInternal *CellTree;
<a name="l00473"></a>00473
<a name="l00474"></a><a class="code" href="a00699.html#47ae289a6b8f8286a22f88734079680f">00474</a> <a class="code" href="a00703.html" title="Objects that can traverse hyperoctree nodes.">vtkHyperOctreeCursor</a> *TmpChild; <span class="comment">// to avoid allocation in the loop</span>
<a name="l00475"></a>00475
<a name="l00476"></a>00476 <span class="comment">//BTX</span>
<a name="l00477"></a><a class="code" href="a00699.html#2dcb14d1c3a3f7fbcb39ddf83aeddb73">00477</a> <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00708.html">vtkHyperOctreeLightWeightCursor</a>;
<a name="l00478"></a>00478 <span class="comment">//ETX</span>
<a name="l00479"></a>00479
<a name="l00480"></a>00480 <span class="comment">// Initialize the arrays if necessary, then return it.</span>
<a name="l00481"></a>00481 <span class="keywordtype">void</span> UpdateDualArrays();
<a name="l00482"></a>00482 <a class="code" href="a01250.html" title="represent and manipulate 3D points">vtkPoints</a>* GetLeafCenters();
<a name="l00483"></a>00483 <a class="code" href="a00722.html" title="dynamic, self-adjusting array of vtkIdType">vtkIdTypeArray</a>* GetCornerLeafIds();
<a name="l00484"></a><a class="code" href="a00699.html#f3ea50957d54bba3f8eb0d9816d256d8">00484</a> <a class="code" href="a01250.html" title="represent and manipulate 3D points">vtkPoints</a> *LeafCenters;
<a name="l00485"></a><a class="code" href="a00699.html#b5ef70357be8b5aa61339b13a81e151b">00485</a> <a class="code" href="a00722.html" title="dynamic, self-adjusting array of vtkIdType">vtkIdTypeArray</a> *CornerLeafIds;
<a name="l00486"></a>00486
<a name="l00487"></a>00487 <span class="keywordtype">void</span> UpdateGridArrays();
<a name="l00488"></a>00488 <a class="code" href="a01250.html" title="represent and manipulate 3D points">vtkPoints</a>* GetCornerPoints();
<a name="l00489"></a>00489 <a class="code" href="a00722.html" title="dynamic, self-adjusting array of vtkIdType">vtkIdTypeArray</a>* GetLeafCornerIds();
<a name="l00490"></a><a class="code" href="a00699.html#5963adebb91aa02996f84c1c7ac590bc">00490</a> <a class="code" href="a01250.html" title="represent and manipulate 3D points">vtkPoints</a>* CornerPoints;
<a name="l00491"></a><a class="code" href="a00699.html#e20347a38e1e109d25cb1796e39ef745">00491</a> <a class="code" href="a00722.html" title="dynamic, self-adjusting array of vtkIdType">vtkIdTypeArray</a>* LeafCornerIds;
<a name="l00492"></a>00492
<a name="l00493"></a>00493 <span class="keywordtype">void</span> DeleteInternalArrays();
<a name="l00494"></a>00494
<a name="l00495"></a>00495 <span class="keywordtype">void</span> TraverseDualRecursively(<a class="code" href="a00708.html">vtkHyperOctreeLightWeightCursor</a>* neighborhood,
<a name="l00496"></a>00496 <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> *xyzIds, <span class="keywordtype">int</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2103f20abad13593a5879a08c3e64355835">level</a>);
<a name="l00497"></a>00497 <span class="keywordtype">void</span> TraverseGridRecursively(<a class="code" href="a00708.html">vtkHyperOctreeLightWeightCursor</a>* neighborhood,
<a name="l00498"></a>00498 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* visited,
<a name="l00499"></a>00499 <span class="keywordtype">double</span>* origin, <span class="keywordtype">double</span>* <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d210e3d5e7c015dff08d8daf72a0102e1444">size</a>);
<a name="l00500"></a>00500 <span class="keywordtype">void</span> EvaluateDualCorner(<a class="code" href="a00708.html">vtkHyperOctreeLightWeightCursor</a>* neighborhood);
<a name="l00501"></a>00501 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> EvaluateGridCorner(<span class="keywordtype">int</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2103f20abad13593a5879a08c3e64355835">level</a>,<a class="code" href="a00708.html">vtkHyperOctreeLightWeightCursor</a>* neighborhood,
<a name="l00502"></a>00502 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* visited, <span class="keywordtype">int</span>* cornerNeighborIds);
<a name="l00503"></a>00503
<a name="l00504"></a>00504 <span class="comment">// This is a table for traversing a neighborhood down an octree.</span>
<a name="l00505"></a>00505 <span class="comment">// 8 children x 27 cursors</span>
<a name="l00506"></a>00506 <span class="comment">// First three bits encode the child, rest encode the cursor id.</span>
<a name="l00507"></a>00507 <span class="comment">// 8xCursorId + childId.</span>
<a name="l00508"></a>00508 <span class="comment">// This will be shorter when we get rid of the 3x3x3 neighborhood.</span>
<a name="l00509"></a>00509 <span class="comment">// I was using unsigned char, but VS60 optimized build had a problem.</span>
<a name="l00510"></a><a class="code" href="a00699.html#5075958c6b8a3ca46773d5f62fbaaa00">00510</a> <span class="keywordtype">int</span> NeighborhoodTraversalTable[216];
<a name="l00511"></a>00511 <span class="keywordtype">void</span> GenerateGridNeighborhoodTraversalTable();
<a name="l00512"></a>00512 <span class="keywordtype">void</span> GenerateDualNeighborhoodTraversalTable();
<a name="l00513"></a>00513
<a name="l00514"></a>00514 <span class="comment">// for the GetCell method</span>
<a name="l00515"></a><a class="code" href="a00699.html#7b8ab63467be3a4c0b3d5c2dc3a7d6a7">00515</a> <a class="code" href="a00960.html" title="cell represents a 1D line">vtkLine</a> *Line;
<a name="l00516"></a><a class="code" href="a00699.html#99d3259240bd1ec538c037684d459f1e">00516</a> <a class="code" href="a01221.html" title="a cell that represents an orthogonal quadrilateral">vtkPixel</a> *Pixel;
<a name="l00517"></a><a class="code" href="a00699.html#bdd43db578590be52387e1a06deea86e">00517</a> <a class="code" href="a01859.html" title="a cell that represents a 3D orthogonal parallelepiped">vtkVoxel</a> *Voxel;
<a name="l00518"></a>00518
<a name="l00519"></a><a class="code" href="a00699.html#0f18e864c7e720b25bdc99b428f68c52">00519</a> <a class="code" href="a00248.html" title="object represents upward pointers from points to list of cells using each point">vtkCellLinks</a>* Links;
<a name="l00520"></a>00520 <span class="keywordtype">void</span> BuildLinks();
<a name="l00521"></a>00521
<a name="l00522"></a>00522 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> RecursiveFindPoint(<span class="keywordtype">double</span> x[3],
<a name="l00523"></a>00523 <a class="code" href="a00708.html">vtkHyperOctreeLightWeightCursor</a>* cursor,
<a name="l00524"></a>00524 <span class="keywordtype">double</span> *origin, <span class="keywordtype">double</span> *<a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d210e3d5e7c015dff08d8daf72a0102e1444">size</a>);
<a name="l00525"></a>00525
<a name="l00526"></a>00526 <span class="comment">// This toggles the data set API between the leaf cells and</span>
<a name="l00527"></a>00527 <span class="comment">// the dual grid (leaves are points, corners are cells). </span>
<a name="l00528"></a><a class="code" href="a00699.html#bc95da4ee62137de143aa5b1fe800984">00528</a> <span class="keywordtype">int</span> DualGridFlag;
<a name="l00529"></a>00529
<a name="l00530"></a>00530 <span class="keyword">private</span>:
<a name="l00531"></a>00531 <a class="code" href="a00699.html" title="A dataset structured as a tree where each node has exactly 2^n children.">vtkHyperOctree</a>(<span class="keyword">const</span> <a class="code" href="a00699.html" title="A dataset structured as a tree where each node has exactly 2^n children.">vtkHyperOctree</a>&); <span class="comment">// Not implemented.</span>
<a name="l00532"></a>00532 <span class="keywordtype">void</span> operator=(<span class="keyword">const</span> <a class="code" href="a00699.html" title="A dataset structured as a tree where each node has exactly 2^n children.">vtkHyperOctree</a>&); <span class="comment">// Not implemented.</span>
<a name="l00533"></a>00533 };
<a name="l00534"></a>00534
<a name="l00535"></a>00535
<a name="l00536"></a>00536 <span class="comment">//BTX</span>
<a name="l00537"></a>00537
<a name="l00538"></a><a class="code" href="a00708.html">00538</a> <span class="keyword">class </span><a class="code" href="a02170.html#95ced7977a6b6b1bf9f38bf04e3835b6">VTK_FILTERING_EXPORT</a> <a class="code" href="a00708.html">vtkHyperOctreeLightWeightCursor</a>
<a name="l00539"></a>00539 {
<a name="l00540"></a>00540 <span class="keyword">public</span>:
<a name="l00541"></a>00541 <a class="code" href="a00708.html">vtkHyperOctreeLightWeightCursor</a>();
<a name="l00542"></a>00542 ~<a class="code" href="a00708.html">vtkHyperOctreeLightWeightCursor</a>();
<a name="l00543"></a>00543
<a name="l00544"></a>00544 <span class="keywordtype">void</span> Initialize(<a class="code" href="a00699.html" title="A dataset structured as a tree where each node has exactly 2^n children.">vtkHyperOctree</a>* tree);
<a name="l00545"></a>00545 <span class="keywordtype">void</span> ToRoot();
<a name="l00546"></a>00546 <span class="keywordtype">void</span> ToChild(<span class="keywordtype">int</span> child);
<a name="l00547"></a>00547 <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> GetIsLeaf();
<a name="l00548"></a><a class="code" href="a00708.html#2d889abf314d2441b893bf2b21967c81">00548</a> <span class="keywordtype">int</span> GetLeafIndex() {<span class="keywordflow">return</span> this->Index;} <span class="comment">// Only valid for leaves.</span>
<a name="l00549"></a><a class="code" href="a00708.html#03792be6339cb41708e721eb6bdee982">00549</a> <a class="code" href="a00699.html" title="A dataset structured as a tree where each node has exactly 2^n children.">vtkHyperOctree</a>* GetTree() { <span class="keywordflow">return</span> this->Tree; }
<a name="l00550"></a><a class="code" href="a00708.html#d4642cc3b4dcbf925b32f6b33d0318c7">00550</a> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> GetLevel() {<span class="keywordflow">return</span> this->Level;}
<a name="l00551"></a>00551 <span class="keyword">private</span>:
<a name="l00552"></a>00552 <a class="code" href="a00699.html" title="A dataset structured as a tree where each node has exactly 2^n children.">vtkHyperOctree</a>* Tree;
<a name="l00553"></a>00553 <span class="keywordtype">int</span> Index;
<a name="l00554"></a>00554 <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> IsLeaf;
<a name="l00555"></a>00555 <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> Level;
<a name="l00556"></a>00556 };
<a name="l00557"></a>00557
<a name="l00558"></a>00558 <span class="comment">//ETX</span>
<a name="l00559"></a>00559
<a name="l00560"></a>00560 <span class="preprocessor">#endif</span>
</pre></div></div>
<hr size="1"><address style="text-align: right;"><small>Generated on Wed Jun 3 18:35:16 2009 for VTK by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.6 </small></address>
</body>
</html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
60f1dc962abad0f3b492991a4fbef9be
>
files
>
4064
