vtkBSPCuts.h

Go to the documentation of this file.

/*=========================================================================
 
  Program:   Visualization Toolkit
  Module:    vtkBSPCuts.h
 
  Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
  All rights reserved.
  See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
 
     This software is distributed WITHOUT ANY WARRANTY; without even
     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
     PURPOSE.  See the above copyright notice for more information.
 
=========================================================================*/
/*----------------------------------------------------------------------------
 Copyright (c) Sandia Corporation
 See Copyright.txt or http://www.paraview.org/HTML/Copyright.html for details.
----------------------------------------------------------------------------*/
 
#ifndef vtkBSPCuts_h
#define vtkBSPCuts_h
 
#include "vtkCommonDataModelModule.h" // For export macro
#include "vtkDataObject.h"
 
class vtkKdNode;
 
class VTKCOMMONDATAMODEL_EXPORT vtkBSPCuts : public vtkDataObject
{
public:
  static vtkBSPCuts* New();
  vtkTypeMacro(vtkBSPCuts, vtkDataObject);
  void PrintSelf(ostream& os, vtkIndent indent) override;
 
  void CreateCuts(double* bounds, int ncuts, int* dim, double* coord, int* lower, int* upper,
    double* lowerDataCoord, double* upperDataCoord, int* npoints);
 
  void CreateCuts(vtkKdNode* kd);
 
  vtkKdNode* GetKdNodeTree() { return this->Top; }
 
  vtkGetMacro(NumberOfCuts, int);
 
  int GetArrays(int len, int* dim, double* coord, int* lower, int* upper, double* lowerDataCoord,
    double* upperDataCoord, int* npoints);
 
  int Equals(vtkBSPCuts* other, double tolerance = 0.0);
 
  void PrintTree();
  void PrintArrays();
 
 
  static vtkBSPCuts* GetData(vtkInformation* info);
  static vtkBSPCuts* GetData(vtkInformationVector* v, int i = 0);
 
  void Initialize() override;
 
 
  void ShallowCopy(vtkDataObject* src) override;
  void DeepCopy(vtkDataObject* src) override;
 
protected:
  vtkBSPCuts();
  ~vtkBSPCuts() override;
 
  static void DeleteAllDescendants(vtkKdNode* kd);
 
  static int CountNodes(vtkKdNode* kd);
  static void SetMinMaxId(vtkKdNode* kd);
  static void _PrintTree(vtkKdNode* kd, int depth);
 
  void BuildTree(vtkKdNode* kd, int idx);
  int WriteArray(vtkKdNode* kd, int loc);
 
  void ResetArrays();
  void AllocateArrays(int size);
 
  vtkKdNode* Top;
 
  // required cut information
 
  int NumberOfCuts; // number of cuts, also length of each array
  int* Dim;         // dimension (x/y/z - 0/1/2) where cut occurs
  double* Coord;    // location of cut along axis
  int* Lower;       // location in arrays of left (lower) child info
  int* Upper;       // location in arrays of right (lower) child info
 
  // optional cut information
 
  double* LowerDataCoord; // coordinate of uppermost data in lower half
  double* UpperDataCoord; // coordinate of lowermost data in upper half
  int* Npoints;           // number of data values in partition
 
  double Bounds[6];
 
  vtkBSPCuts(const vtkBSPCuts&) = delete;
  void operator=(const vtkBSPCuts&) = delete;
};
 
#endif