00001 /*========================================================================= 00002 00003 Program: Visualization Toolkit 00004 Module: $RCSfile: vtkScalarTree.h,v $ 00005 Language: C++ 00006 00007 00008 Copyright (c) 1993-2001 Ken Martin, Will Schroeder, Bill Lorensen 00009 All rights reserved. 00010 00011 Redistribution and use in source and binary forms, with or without 00012 modification, are permitted provided that the following conditions are met: 00013 00014 * Redistributions of source code must retain the above copyright notice, 00015 this list of conditions and the following disclaimer. 00016 00017 * Redistributions in binary form must reproduce the above copyright notice, 00018 this list of conditions and the following disclaimer in the documentation 00019 and/or other materials provided with the distribution. 00020 00021 * Neither name of Ken Martin, Will Schroeder, or Bill Lorensen nor the names 00022 of any contributors may be used to endorse or promote products derived 00023 from this software without specific prior written permission. 00024 00025 * Modified source versions must be plainly marked as such, and must not be 00026 misrepresented as being the original software. 00027 00028 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS IS'' 00029 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00030 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00031 ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR 00032 ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 00033 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 00034 SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 00035 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 00036 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 00037 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00038 00039 =========================================================================*/ 00062 #ifndef __vtkScalarTree_h 00063 #define __vtkScalarTree_h 00064 00065 #include "vtkObject.h" 00066 #include "vtkDataSet.h" 00067 00068 typedef struct _vtkScalarRange 00069 { 00070 float min; 00071 float max; 00072 } vtkScalarRange; 00073 00074 00075 class VTK_EXPORT vtkScalarTree : public vtkObject 00076 { 00077 public: 00078 vtkTypeMacro(vtkScalarTree,vtkObject); 00079 void PrintSelf(ostream& os, vtkIndent indent); 00080 00083 static vtkScalarTree *New(); 00084 00086 vtkSetObjectMacro(DataSet,vtkDataSet); 00087 vtkGetObjectMacro(DataSet,vtkDataSet); 00088 00093 vtkSetClampMacro(BranchingFactor,int,2,VTK_LARGE_INTEGER); 00094 vtkGetMacro(BranchingFactor,int); 00095 00099 vtkGetMacro(Level,int); 00100 00102 vtkSetClampMacro(MaxLevel,int,1,VTK_LARGE_INTEGER); 00103 vtkGetMacro(MaxLevel,int); 00104 00108 void BuildTree(); 00109 00111 void Initialize(); 00112 00115 void InitTraversal(float scalarValue); 00116 00121 vtkCell *GetNextCell(int &cellId, vtkIdList* &ptIds, 00122 vtkScalars *cellScalars); 00123 00124 #ifndef VTK_REMOVE_LEGACY_CODE 00125 00126 vtkCell *GetNextCell(int& cellId, vtkIdList* &ptIds, vtkScalars& cellScalars) 00127 {VTK_LEGACY_METHOD(GetNextCell,"3.2"); return this->GetNextCell(cellId, ptIds, &cellScalars);} 00128 #endif 00129 00130 protected: 00131 vtkScalarTree(); 00132 ~vtkScalarTree(); 00133 vtkScalarTree(const vtkScalarTree&) {}; 00134 void operator=(const vtkScalarTree&) {}; 00135 00136 vtkDataSet *DataSet; 00137 vtkScalars *Scalars; 00138 int MaxLevel; 00139 int Level; 00140 int BranchingFactor; //number of children per node 00141 00142 vtkScalarRange *Tree; //pointerless scalar range tree 00143 int TreeSize; //allocated size of tree 00144 vtkTimeStamp BuildTime; //time at which tree was built 00145 00146 private: 00147 float ScalarValue; //current scalar value for traversal 00148 int TreeIndex; //traversal location within tree 00149 int LeafOffset; //offset to leaf nodes of tree 00150 int ChildNumber; //current child in traversal 00151 int CellId; //current cell id being examined 00152 int FindStartLeaf(int index, int level); 00153 int FindNextLeaf(int index,int level); 00154 }; 00155 00156 #endif 00157 00158