mirror of
https://gitlab.kitware.com/vtk/vtk-m
synced 2024-09-20 02:55:47 +00:00
bddad9b386
Now that the dispatcher does its own TryExecute, filters do not need to do that. This change requires all worklets called by filters to be able to execute without knowing the device a priori.
94 lines
3.8 KiB
C++
94 lines
3.8 KiB
C++
//============================================================================
|
|
// Copyright (c) Kitware, Inc.
|
|
// All rights reserved.
|
|
// See LICENSE.txt 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 2014 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
|
|
// Copyright 2014 UT-Battelle, LLC.
|
|
// Copyright 2014 Los Alamos National Security.
|
|
//
|
|
// Under the terms of Contract DE-NA0003525 with NTESS,
|
|
// the U.S. Government retains certain rights in this software.
|
|
//
|
|
// Under the terms of Contract DE-AC52-06NA25396 with Los Alamos National
|
|
// Laboratory (LANL), the U.S. Government retains certain rights in
|
|
// this software.
|
|
//============================================================================
|
|
|
|
#ifndef vtk_m_filter_VertexClustering_h
|
|
#define vtk_m_filter_VertexClustering_h
|
|
|
|
#include <vtkm/filter/FilterDataSet.h>
|
|
#include <vtkm/worklet/VertexClustering.h>
|
|
|
|
namespace vtkm
|
|
{
|
|
namespace filter
|
|
{
|
|
|
|
/// \brief Reduce the number of triangles in a mesh
|
|
///
|
|
/// VertexClustering is a filter to reduce the number of triangles in a
|
|
/// triangle mesh, forming a good approximation to the original geometry. The
|
|
/// input must be a dataset that only contains triangles.
|
|
///
|
|
/// The general approach of the algorithm is to cluster vertices in a uniform
|
|
/// binning of space, accumulating to an average point within each bin. In
|
|
/// more detail, the algorithm first gets the bounds of the input poly data.
|
|
/// It then breaks this bounding volume into a user-specified number of
|
|
/// spatial bins. It then reads each triangle from the input and hashes its
|
|
/// vertices into these bins. Then, if 2 or more vertices of
|
|
/// the triangle fall in the same bin, the triangle is dicarded. If the
|
|
/// triangle is not discarded, it adds the triangle to the list of output
|
|
/// triangles as a list of vertex identifiers. (There is one vertex id per
|
|
/// bin.) After all the triangles have been read, the representative vertex
|
|
/// for each bin is computed. This determines the spatial location of the
|
|
/// vertices of each of the triangles in the output.
|
|
///
|
|
/// To use this filter, specify the divisions defining the spatial subdivision
|
|
/// in the x, y, and z directions. Compared to algorithms such as
|
|
/// vtkQuadricClustering, a significantly higher bin count is recommended as it
|
|
/// doesn't increase the computation or memory of the algorithm and will produce
|
|
/// significantly better results.
|
|
///
|
|
/// @warning
|
|
/// This filter currently doesn't propagate cell or point fields
|
|
|
|
class VertexClustering : public vtkm::filter::FilterDataSet<VertexClustering>
|
|
{
|
|
public:
|
|
VTKM_CONT
|
|
VertexClustering();
|
|
|
|
VTKM_CONT
|
|
void SetNumberOfDivisions(const vtkm::Id3& num) { this->NumberOfDivisions = num; }
|
|
|
|
VTKM_CONT
|
|
const vtkm::Id3& GetNumberOfDivisions() const { return this->NumberOfDivisions; }
|
|
|
|
template <typename DerivedPolicy>
|
|
VTKM_CONT vtkm::cont::DataSet DoExecute(const vtkm::cont::DataSet& input,
|
|
const vtkm::filter::PolicyBase<DerivedPolicy>& policy);
|
|
|
|
//Map a new field onto the resulting dataset after running the filter
|
|
//this call is only valid
|
|
template <typename T, typename StorageType, typename DerivedPolicy>
|
|
VTKM_CONT bool DoMapField(vtkm::cont::DataSet& result,
|
|
const vtkm::cont::ArrayHandle<T, StorageType>& input,
|
|
const vtkm::filter::FieldMetadata& fieldMeta,
|
|
vtkm::filter::PolicyBase<DerivedPolicy> policy);
|
|
|
|
private:
|
|
vtkm::worklet::VertexClustering Worklet;
|
|
vtkm::Id3 NumberOfDivisions;
|
|
};
|
|
}
|
|
} // namespace vtkm::filter
|
|
|
|
#include <vtkm/filter/VertexClustering.hxx>
|
|
|
|
#endif // vtk_m_filter_VertexClustering_h
|