/*=========================================================================

  Program:   Visualization Toolkit
  Module:    vtkPResampleWithDataSet.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.

=========================================================================*/
/**
 * @class   vtkPResampleWithDataSet
 * points from another dataset.
 *
 * vtkPResampleWithDataSet is the parallel version of vtkResampleWithDataSet
 * filter
 * @sa
 * vtkResampleWithDataSet vtkPResampleToImage
*/

#ifndef vtkPResampleWithDataSet_h
#define vtkPResampleWithDataSet_h

#include "vtkFiltersParallelDIY2Module.h" // For export macro
#include "vtkResampleWithDataSet.h"


class vtkMultiProcessController;

class VTKFILTERSPARALLELDIY2_EXPORT vtkPResampleWithDataSet : public vtkResampleWithDataSet
{
public:
  vtkTypeMacro(vtkPResampleWithDataSet, vtkResampleWithDataSet);
  void PrintSelf(ostream& os, vtkIndent indent);

  static vtkPResampleWithDataSet *New();

  //@{
  /**
   * By defualt this filter uses the global controller,
   * but this method can be used to set another instead.
   */
  virtual void SetController(vtkMultiProcessController*);
  vtkGetObjectMacro(Controller, vtkMultiProcessController);
  //@}

  //@{
  /**
   * Set/Get if the filter should use Balanced Partitioning for fast lookup of
   * the input points. Balanced Partitioning partitions the points into similar
   * sized bins. It takes logarithmic time to search for the candidate bins, but
   * search inside border bins takes constant time.
   * The default is to use Regular Partitioning which partitions the space of the
   * points into regular sized bins. Based on their distribution, the bins may
   * contain widely varying number of points. It takes constant time to search
   * for the candidate bins but search within border bins can vary.
   * For most cases, both techniques perform the same with Regular Partitioning
   * being slightly better. Balanced Partitioning may perform better when the
   * points distribution is highly skewed.
   */
  vtkSetMacro(UseBalancedPartitionForPointsLookup, bool);
  vtkGetMacro(UseBalancedPartitionForPointsLookup, bool);
  vtkBooleanMacro(UseBalancedPartitionForPointsLookup, bool);
  //@}

protected:
  vtkPResampleWithDataSet();
  ~vtkPResampleWithDataSet();

  virtual int RequestData(vtkInformation *, vtkInformationVector **,
                          vtkInformationVector *);

  vtkMultiProcessController *Controller;
  bool UseBalancedPartitionForPointsLookup;

private:
  vtkPResampleWithDataSet(const vtkPResampleWithDataSet&) VTK_DELETE_FUNCTION;
  void operator=(const vtkPResampleWithDataSet&) VTK_DELETE_FUNCTION;
};

#endif // vtkPResampleWithDataSet_h
