mirror of
https://gitlab.kitware.com/vtk/vtk-m
synced 2024-09-16 17:22:55 +00:00
migrated ContourTreeUniformDistributed filter
This commit is contained in:
parent
22ee3c3fa5
commit
d1cede4d2b
@ -71,7 +71,7 @@
|
||||
#include <vtkm/cont/Timer.h>
|
||||
#include <vtkm/io/BOVDataSetReader.h>
|
||||
|
||||
#include <vtkm/filter/ContourTreeUniformDistributed.h>
|
||||
#include "vtkm/filter/scalar_topology/ContourTreeUniformDistributed.h"
|
||||
#include <vtkm/filter/scalar_topology/DistributedBranchDecompositionFilter.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/branch_decomposition/HierarchicalVolumetricBranchDecomposer.h>
|
||||
#include <vtkm/worklet/contourtree_augmented/PrintVectors.h>
|
||||
|
@ -20,6 +20,7 @@ set(deprecated_headers
|
||||
Contour.h
|
||||
ContourTreeUniform.h
|
||||
ContourTreeUniformAugmented.h
|
||||
ContourTreeUniformDistributed.h
|
||||
CoordinateSystemTransform.h
|
||||
CrossProduct.h
|
||||
DotProduct.h
|
||||
@ -101,7 +102,6 @@ set(common_header_template_sources
|
||||
vtkm_declare_headers(${common_header_template_sources})
|
||||
|
||||
set(extra_headers
|
||||
ContourTreeUniformDistributed.h
|
||||
Lagrangian.h
|
||||
LagrangianStructures.h
|
||||
ParticleAdvection.h
|
||||
@ -112,7 +112,6 @@ set(extra_headers
|
||||
)
|
||||
|
||||
set(extra_header_template_sources
|
||||
ContourTreeUniformDistributed.hxx
|
||||
Lagrangian.hxx
|
||||
LagrangianStructures.hxx
|
||||
ParticleAdvection.hxx
|
||||
|
@ -7,265 +7,28 @@
|
||||
// the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
|
||||
// PURPOSE. See the above copyright notice for more information.
|
||||
//============================================================================
|
||||
// Copyright (c) 2018, The Regents of the University of California, through
|
||||
// Lawrence Berkeley National Laboratory (subject to receipt of any required approvals
|
||||
// from the U.S. Dept. of Energy). All rights reserved.
|
||||
//
|
||||
// Redistribution and use in source and binary forms, with or without modification,
|
||||
// are permitted provided that the following conditions are met:
|
||||
//
|
||||
// (1) Redistributions of source code must retain the above copyright notice, this
|
||||
// list of conditions and the following disclaimer.
|
||||
//
|
||||
// (2) Redistributions in binary form must reproduce the above copyright notice,
|
||||
// this list of conditions and the following disclaimer in the documentation
|
||||
// and/or other materials provided with the distribution.
|
||||
//
|
||||
// (3) Neither the name of the University of California, Lawrence Berkeley National
|
||||
// Laboratory, U.S. Dept. of Energy nor the names of its contributors may be
|
||||
// used to endorse or promote products derived from this software without
|
||||
// specific prior written permission.
|
||||
//
|
||||
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
||||
// ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
||||
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
||||
// IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
|
||||
// INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
|
||||
// BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
|
||||
// OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
|
||||
// OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
//
|
||||
//=============================================================================
|
||||
//
|
||||
// This code is an extension of the algorithm presented in the paper:
|
||||
// Parallel Peak Pruning for Scalable SMP Contour Tree Computation.
|
||||
// Hamish Carr, Gunther Weber, Christopher Sewell, and James Ahrens.
|
||||
// Proceedings of the IEEE Symposium on Large Data Analysis and Visualization
|
||||
// (LDAV), October 2016, Baltimore, Maryland.
|
||||
//
|
||||
// The PPP2 algorithm and software were jointly developed by
|
||||
// Hamish Carr (University of Leeds), Gunther H. Weber (LBNL), and
|
||||
// Oliver Ruebel (LBNL)
|
||||
//==============================================================================
|
||||
|
||||
|
||||
#ifndef vtk_m_filter_ContourTreeUniformDistributed_h
|
||||
#define vtk_m_filter_ContourTreeUniformDistributed_h
|
||||
|
||||
#include <vtkm/Types.h>
|
||||
#include <vtkm/cont/ArrayHandle.h>
|
||||
#include <vtkm/filter/scalar_topology/internal/SpatialDecomposition.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/ContourTree.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/DataSetMesh.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/BoundaryTree.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/HierarchicalContourTree.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/InteriorForest.h>
|
||||
|
||||
#include <vtkm/filter/FilterField.h>
|
||||
|
||||
#include <memory>
|
||||
#include <vtkm/Deprecated.h>
|
||||
#include <vtkm/filter/scalar_topology/ContourTreeUniformDistributed.h>
|
||||
|
||||
namespace vtkm
|
||||
{
|
||||
namespace filter
|
||||
{
|
||||
|
||||
/// \brief Construct the Contour Tree for a 2D or 3D regular mesh
|
||||
///
|
||||
/// This filter implements the parallel peak pruning algorithm. In contrast to
|
||||
/// the ContourTreeUniform filter, this filter is optimized to allow for the
|
||||
/// computation of the augmented contour tree, i.e., the contour tree including
|
||||
/// all regular mesh vertices. Augmentation with regular vertices is used in
|
||||
/// practice to compute statistics (e.g., volume), to segment the input mesh,
|
||||
/// facilitate iso-value selection, enable localization of all verticies of a
|
||||
/// mesh in the tree among others.
|
||||
///
|
||||
/// In addition to single-block computation, the filter also supports multi-block
|
||||
/// regular grids. The blocks are processed in parallel using DIY and then the
|
||||
/// tree are merged progressively using a binary-reduction scheme to compute the
|
||||
/// final contour tree. I.e., in the multi-block context, the final tree is
|
||||
/// constructed on rank 0.
|
||||
class ContourTreeUniformDistributed
|
||||
: public vtkm::filter::FilterField<ContourTreeUniformDistributed>
|
||||
VTKM_DEPRECATED(1.8,
|
||||
"Use vtkm/filter/scalar_topology/ContourTreeUniformDistributed.h instead of "
|
||||
"vtkm/filter/ContourTreeUniformDistributed.h.")
|
||||
inline void ContourTreeUniformDistributed_deprecated() {}
|
||||
|
||||
inline void ContourTreeUniformDistributed_deprecated_warning()
|
||||
{
|
||||
public:
|
||||
using SupportedTypes = vtkm::TypeListScalarAll;
|
||||
///
|
||||
/// Create the contour tree filter
|
||||
/// @param[in] blocksPerDim Number of data blocks used in each data dimension
|
||||
/// @param[in] globalSize Global extends of the input mesh (i.e., number of mesh points in each dimension)
|
||||
/// @param[in] localBlockIndices Array with the (x,y,z) index of each local data block with
|
||||
/// with respect to blocksPerDim
|
||||
/// @param[in] localBlockOrigins Array with the (x,y,z) origin (with regard to mesh index) of each
|
||||
/// local data block
|
||||
/// @param[in] localBlockSizes Array with the sizes (i.e., extends in number of mesh points) of each
|
||||
/// local data block
|
||||
/// @param[in] useMarchingCubes Boolean indicating whether marching cubes (true) or freudenthal (false)
|
||||
/// connectivity should be used. Valid only for 3D input data. Default is false.
|
||||
/// @param[in] saveDotFiles Save debug dot output files for the distributed contour tree compute.
|
||||
/// @param[in] timingsLogLevel Set the vtkm::cont:LogLevel to be used to record timings information
|
||||
/// specific to the computation of the hierachical contour tree
|
||||
/// @param[in] treeLogLevel Set the vtkm::cont:LogLevel to be used to record metadata information
|
||||
/// about the various trees computed as part of the hierarchical contour tree compute
|
||||
VTKM_CONT
|
||||
VTKM_DEPRECATED(1.8,
|
||||
"ContourTreeUniformDistributed no longer requires flags as part of constructor. "
|
||||
"Use appropriate Set<X> methods.")
|
||||
ContourTreeUniformDistributed(
|
||||
vtkm::Id3 blocksPerDim, // TODO/FIXME: Possibly pass SpatialDecomposition object instead
|
||||
vtkm::Id3 globalSize,
|
||||
const vtkm::cont::ArrayHandle<vtkm::Id3>& localBlockIndices,
|
||||
const vtkm::cont::ArrayHandle<vtkm::Id3>& localBlockOrigins,
|
||||
const vtkm::cont::ArrayHandle<vtkm::Id3>& localBlockSizes,
|
||||
bool useBoundaryExtremaOnly = true,
|
||||
bool useMarchingCubes = false,
|
||||
bool augmentHierarchicalTree = false,
|
||||
bool saveDotFiles = false,
|
||||
vtkm::cont::LogLevel timingsLogLevel = vtkm::cont::LogLevel::Perf,
|
||||
vtkm::cont::LogLevel treeLogLevel = vtkm::cont::LogLevel::Info);
|
||||
ContourTreeUniformDistributed_deprecated();
|
||||
}
|
||||
|
||||
VTKM_CONT
|
||||
ContourTreeUniformDistributed(
|
||||
vtkm::Id3 blocksPerDim, // TODO/FIXME: Possibly pass SpatialDecomposition object instead
|
||||
vtkm::Id3 globalSize,
|
||||
const vtkm::cont::ArrayHandle<vtkm::Id3>& localBlockIndices,
|
||||
const vtkm::cont::ArrayHandle<vtkm::Id3>& localBlockOrigins,
|
||||
const vtkm::cont::ArrayHandle<vtkm::Id3>& localBlockSizes,
|
||||
vtkm::cont::LogLevel timingsLogLevel = vtkm::cont::LogLevel::Perf,
|
||||
vtkm::cont::LogLevel treeLogLevel = vtkm::cont::LogLevel::Info);
|
||||
}
|
||||
} // namespace vtkm::filter
|
||||
|
||||
VTKM_CONT void SetUseBoundaryExtremaOnly(bool useBoundaryExtremaOnly)
|
||||
{
|
||||
this->UseBoundaryExtremaOnly = useBoundaryExtremaOnly;
|
||||
}
|
||||
|
||||
VTKM_CONT bool GetUseBoundaryExtremaOnly() { return this->UseBoundaryExtremaOnly; }
|
||||
|
||||
VTKM_CONT void SetUseMarchingCubes(bool useMarchingCubes)
|
||||
{
|
||||
this->UseMarchingCubes = useMarchingCubes;
|
||||
}
|
||||
|
||||
VTKM_CONT bool GetUseMarchingCubes() { return this->UseMarchingCubes; }
|
||||
|
||||
VTKM_CONT void SetAugmentHierarchicalTree(bool augmentHierarchicalTree)
|
||||
{
|
||||
this->AugmentHierarchicalTree = augmentHierarchicalTree;
|
||||
}
|
||||
|
||||
VTKM_CONT bool GetAugmentHierarchicalTree() { return this->AugmentHierarchicalTree; }
|
||||
|
||||
VTKM_CONT void SetSaveDotFiles(bool saveDotFiles) { this->SaveDotFiles = saveDotFiles; }
|
||||
|
||||
VTKM_CONT bool GetSaveDotFiles() { return this->SaveDotFiles; }
|
||||
|
||||
template <typename DerivedPolicy>
|
||||
VTKM_CONT vtkm::cont::PartitionedDataSet PrepareForExecution(
|
||||
const vtkm::cont::PartitionedDataSet& input,
|
||||
const vtkm::filter::PolicyBase<DerivedPolicy>& policy);
|
||||
|
||||
template <typename T, typename StorageType, typename DerivedPolicy>
|
||||
VTKM_CONT void ComputeLocalTree(const vtkm::Id blockIndex,
|
||||
const vtkm::cont::DataSet& input,
|
||||
const vtkm::cont::ArrayHandle<T, StorageType>& field,
|
||||
const vtkm::filter::FieldMetadata& fieldMeta,
|
||||
vtkm::filter::PolicyBase<DerivedPolicy> policy);
|
||||
|
||||
/// Implement per block contour tree computation after the MeshType has been discovered
|
||||
template <typename T,
|
||||
typename StorageType,
|
||||
typename DerivedPolicy,
|
||||
typename MeshType,
|
||||
typename MeshBoundaryExecType>
|
||||
VTKM_CONT void ComputeLocalTreeImpl(const vtkm::Id blockIndex,
|
||||
const vtkm::cont::DataSet& input,
|
||||
const vtkm::cont::ArrayHandle<T, StorageType>& field,
|
||||
const vtkm::filter::FieldMetadata& fieldMeta,
|
||||
vtkm::filter::PolicyBase<DerivedPolicy> policy,
|
||||
MeshType& mesh,
|
||||
MeshBoundaryExecType& meshBoundaryExecObject);
|
||||
|
||||
//@{
|
||||
/// when operating on vtkm::cont::MultiBlock we want to
|
||||
/// do processing across ranks as well. Just adding pre/post handles
|
||||
/// for the same does the trick.
|
||||
template <typename DerivedPolicy>
|
||||
VTKM_CONT void PreExecute(const vtkm::cont::PartitionedDataSet& input,
|
||||
const vtkm::filter::PolicyBase<DerivedPolicy>& policy);
|
||||
|
||||
template <typename DerivedPolicy>
|
||||
VTKM_CONT void PostExecute(const vtkm::cont::PartitionedDataSet& input,
|
||||
vtkm::cont::PartitionedDataSet& output,
|
||||
const vtkm::filter::PolicyBase<DerivedPolicy>&);
|
||||
|
||||
|
||||
template <typename FieldType>
|
||||
VTKM_CONT void ComputeVolumeMetric(
|
||||
vtkmdiy::Master& inputContourTreeMaster,
|
||||
vtkmdiy::DynamicAssigner& assigner,
|
||||
vtkmdiy::RegularSwapPartners& partners,
|
||||
const FieldType&, // dummy parameter to get the type
|
||||
std::stringstream& timingsStream,
|
||||
std::vector<vtkm::cont::DataSet>& hierarchicalTreeOutputDataSet);
|
||||
|
||||
///
|
||||
/// Internal helper function that implements the actual functionality of PostExecute
|
||||
///
|
||||
/// In the case we operate on vtkm::cont::MultiBlock we need to merge the trees
|
||||
/// computed on the block to compute the final contour tree.
|
||||
template <typename T, typename StorageType, typename DerivedPolicy>
|
||||
VTKM_CONT void DoPostExecute(
|
||||
const vtkm::cont::PartitionedDataSet& input,
|
||||
vtkm::cont::PartitionedDataSet& output,
|
||||
const vtkm::filter::FieldMetadata& fieldMeta,
|
||||
const vtkm::cont::ArrayHandle<T, StorageType>&, // dummy parameter to get the type
|
||||
vtkm::filter::PolicyBase<DerivedPolicy> policy);
|
||||
//@}
|
||||
|
||||
private:
|
||||
/// Use only boundary critical points in the parallel merge to reduce communication. Disabling this should only be needed for performance testing.
|
||||
bool UseBoundaryExtremaOnly;
|
||||
|
||||
/// Use marching cubes connectivity for computing the contour tree
|
||||
bool UseMarchingCubes;
|
||||
|
||||
/// Augment hierarchical tree
|
||||
bool AugmentHierarchicalTree;
|
||||
|
||||
/// Save dot files for all tree computations
|
||||
bool SaveDotFiles;
|
||||
|
||||
/// Log level to be used for outputting timing information. Default is vtkm::cont::LogLevel::Perf
|
||||
vtkm::cont::LogLevel TimingsLogLevel = vtkm::cont::LogLevel::Perf;
|
||||
|
||||
/// Log level to be used for outputting metadata about the trees. Default is vtkm::cont::LogLevel::Info
|
||||
vtkm::cont::LogLevel TreeLogLevel = vtkm::cont::LogLevel::Info;
|
||||
|
||||
/// Information about the spatial decomposition
|
||||
vtkm::filter::scalar_topology::internal::SpatialDecomposition MultiBlockSpatialDecomposition;
|
||||
|
||||
/// Intermediate results (one per local data block)...
|
||||
/// ... local mesh information needed at end of fan out
|
||||
std::vector<vtkm::worklet::contourtree_augmented::DataSetMesh> LocalMeshes;
|
||||
/// ... local contour trees etc. computed during fan in and used during fan out
|
||||
std::vector<vtkm::worklet::contourtree_augmented::ContourTree> LocalContourTrees;
|
||||
std::vector<vtkm::worklet::contourtree_distributed::BoundaryTree> LocalBoundaryTrees;
|
||||
std::vector<vtkm::worklet::contourtree_distributed::InteriorForest> LocalInteriorForests;
|
||||
|
||||
/// The hierarchical trees computed by the filter (array with one entry per block)
|
||||
// TODO/FIXME: We need to find a way to store the final hieararchical trees somewhere.
|
||||
// Currently we cannot do this here as it is a template on FieldType
|
||||
//
|
||||
//std::vector<vtkm::worklet::contourtree_distributed::HierarchicalContourTree> HierarchicalContourTrees;
|
||||
/// Number of iterations used to compute the contour tree
|
||||
vtkm::Id NumIterations;
|
||||
};
|
||||
|
||||
} // namespace filter
|
||||
} // namespace vtkm
|
||||
|
||||
#include <vtkm/filter/ContourTreeUniformDistributed.hxx>
|
||||
|
||||
#endif // vtk_m_filter_ContourTreeUniformAugmented_h
|
||||
#endif //vtk_m_filter_ContourTreeUniformDistributed_h
|
||||
|
@ -10,6 +10,7 @@
|
||||
set(scalar_topology_headers
|
||||
ContourTreeUniform.h
|
||||
ContourTreeUniformAugmented.h
|
||||
ContourTreeUniformDistributed.h
|
||||
DistributedBranchDecompositionFilter.h
|
||||
)
|
||||
|
||||
@ -18,6 +19,7 @@ set(scalar_topology_sources
|
||||
internal/ComputeDistributedBranchDecompositionFunctor.cxx
|
||||
ContourTreeUniform.cxx
|
||||
ContourTreeUniformAugmented.cxx
|
||||
ContourTreeUniformDistributed.cxx
|
||||
DistributedBranchDecompositionFilter.cxx
|
||||
)
|
||||
|
||||
|
@ -61,8 +61,8 @@ VTKM_THIRDPARTY_PRE_INCLUDE
|
||||
VTKM_THIRDPARTY_POST_INCLUDE
|
||||
// clang-format on
|
||||
|
||||
#include <vtkm/worklet/contourtree_distributed/ContourTreeBlockData.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/MergeBlockFunctor.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/ContourTreeBlockData.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/MergeBlockFunctor.h>
|
||||
|
||||
#include <memory>
|
||||
|
||||
|
@ -60,7 +60,7 @@
|
||||
#include <vtkm/filter/scalar_topology/vtkm_filter_scalar_topology_export.h>
|
||||
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/ContourTree.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/MultiBlockContourTreeHelper.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/MultiBlockContourTreeHelper.h>
|
||||
|
||||
#include <memory>
|
||||
|
||||
|
@ -50,32 +50,29 @@
|
||||
// Oliver Ruebel (LBNL)
|
||||
//==============================================================================
|
||||
|
||||
#ifndef vtk_m_filter_ContourTreeUniformDistributed_hxx
|
||||
#define vtk_m_filter_ContourTreeUniformDistributed_hxx
|
||||
|
||||
// vtkm includes
|
||||
#include <vtkm/cont/ErrorFilterExecution.h>
|
||||
#include <vtkm/cont/Timer.h>
|
||||
|
||||
// single-node augmented contour tree includes
|
||||
#include <vtkm/filter/ContourTreeUniformDistributed.h>
|
||||
#include <vtkm/filter/scalar_topology/ContourTreeUniformDistributed.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/DataSetMesh.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/meshtypes/ContourTreeMesh.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/meshtypes/mesh_boundary/MeshBoundaryContourTreeMesh.h>
|
||||
|
||||
// distributed contour tree includes
|
||||
#include <vtkm/filter/scalar_topology/internal/SpatialDecomposition.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/BoundaryTree.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/BoundaryTreeMaker.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/CombineHyperSweepBlockFunctor.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/ComputeDistributedContourTreeFunctor.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/DistributedContourTreeBlockData.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/HierarchicalAugmenter.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/HierarchicalAugmenterFunctor.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/HierarchicalHyperSweeper.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/HyperSweepBlock.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/InteriorForest.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/PrintGraph.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/TreeGrafter.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/BoundaryTree.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/BoundaryTreeMaker.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/CombineHyperSweepBlockFunctor.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/ComputeDistributedContourTreeFunctor.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/DistributedContourTreeBlockData.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/HierarchicalAugmenterFunctor.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/HierarchicalHyperSweeper.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/HyperSweepBlock.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/InteriorForest.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/PrintGraph.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/TreeGrafter.h>
|
||||
|
||||
// DIY includes
|
||||
// clang-format off
|
||||
@ -89,45 +86,14 @@ namespace vtkm
|
||||
{
|
||||
namespace filter
|
||||
{
|
||||
|
||||
namespace scalar_topology
|
||||
{
|
||||
//-----------------------------------------------------------------------------
|
||||
// Helper structs needed to support approbriate type discovery as part
|
||||
// of pre- and post-execute
|
||||
//-----------------------------------------------------------------------------
|
||||
namespace contourtree_distributed_detail
|
||||
{
|
||||
struct ComputeLocalTree
|
||||
{
|
||||
template <typename T, typename Storage, typename DerivedPolicy>
|
||||
void operator()(const vtkm::cont::ArrayHandle<T, Storage>& field,
|
||||
ContourTreeUniformDistributed* self,
|
||||
const vtkm::Id blockIndex,
|
||||
const vtkm::cont::DataSet& inputData,
|
||||
const vtkm::filter::FieldMetadata& fieldMeta,
|
||||
vtkm::filter::PolicyBase<DerivedPolicy> policy)
|
||||
{
|
||||
self->ComputeLocalTree(blockIndex, inputData, field, fieldMeta, policy);
|
||||
}
|
||||
};
|
||||
|
||||
//----Helper struct to call DoPostExecute. This is used to be able to
|
||||
// wrap the PostExecute work in a functor so that we can use VTK-M's
|
||||
// vtkm::cont::CastAndCall to infer the FieldType template parameters
|
||||
struct PostExecuteCaller
|
||||
{
|
||||
template <typename T, typename S, typename DerivedPolicy>
|
||||
VTKM_CONT void operator()(const vtkm::cont::ArrayHandle<T, S>&,
|
||||
ContourTreeUniformDistributed* self,
|
||||
const vtkm::cont::PartitionedDataSet& input,
|
||||
vtkm::cont::PartitionedDataSet& output,
|
||||
const vtkm::filter::FieldMetadata& fieldMeta,
|
||||
vtkm::filter::PolicyBase<DerivedPolicy> policy) const
|
||||
{
|
||||
vtkm::cont::ArrayHandle<T, S> dummy;
|
||||
self->DoPostExecute(input, output, fieldMeta, dummy, policy);
|
||||
}
|
||||
};
|
||||
|
||||
/// Helper function for saving the content of the tree for debugging
|
||||
template <typename FieldType>
|
||||
void SaveAfterFanInResults(
|
||||
@ -209,8 +175,7 @@ ContourTreeUniformDistributed::ContourTreeUniformDistributed(
|
||||
bool saveDotFiles,
|
||||
vtkm::cont::LogLevel timingsLogLevel,
|
||||
vtkm::cont::LogLevel treeLogLevel)
|
||||
: vtkm::filter::FilterField<ContourTreeUniformDistributed>()
|
||||
, UseBoundaryExtremaOnly(useBoundaryExtremaOnly)
|
||||
: UseBoundaryExtremaOnly(useBoundaryExtremaOnly)
|
||||
, UseMarchingCubes(useMarchingCubes)
|
||||
, AugmentHierarchicalTree(augmentHierarchicalTree)
|
||||
, SaveDotFiles(saveDotFiles)
|
||||
@ -240,8 +205,7 @@ ContourTreeUniformDistributed::ContourTreeUniformDistributed(
|
||||
const vtkm::cont::ArrayHandle<vtkm::Id3>& localBlockSizes,
|
||||
vtkm::cont::LogLevel timingsLogLevel,
|
||||
vtkm::cont::LogLevel treeLogLevel)
|
||||
: vtkm::filter::FilterField<ContourTreeUniformDistributed>()
|
||||
, UseBoundaryExtremaOnly(true)
|
||||
: UseBoundaryExtremaOnly(true)
|
||||
, UseMarchingCubes(false)
|
||||
, AugmentHierarchicalTree(false)
|
||||
, SaveDotFiles(false)
|
||||
@ -265,25 +229,17 @@ ContourTreeUniformDistributed::ContourTreeUniformDistributed(
|
||||
// Functions used in PrepareForExecution() to compute the local contour
|
||||
// tree for the data blocks processed by this rank.
|
||||
//-----------------------------------------------------------------------------
|
||||
template <typename T, typename StorageType, typename DerivedPolicy>
|
||||
template <typename T, typename StorageType>
|
||||
void ContourTreeUniformDistributed::ComputeLocalTree(
|
||||
const vtkm::Id blockIndex,
|
||||
const vtkm::cont::DataSet& input,
|
||||
const vtkm::cont::ArrayHandle<T, StorageType>& field,
|
||||
const vtkm::filter::FieldMetadata& fieldMeta,
|
||||
vtkm::filter::PolicyBase<DerivedPolicy> policy)
|
||||
const vtkm::cont::ArrayHandle<T, StorageType>& fieldArray)
|
||||
{
|
||||
// Check that the field is Ok
|
||||
if (fieldMeta.IsPointField() == false)
|
||||
{
|
||||
throw vtkm::cont::ErrorFilterExecution("Point field expected.");
|
||||
}
|
||||
|
||||
// Get mesh size
|
||||
vtkm::Id3 meshSize;
|
||||
const auto& cells = input.GetCellSet();
|
||||
vtkm::filter::ApplyPolicyCellSet(cells, policy, *this)
|
||||
.CastAndCall(vtkm::worklet::contourtree_augmented::GetPointDimensions(), meshSize);
|
||||
cells.CastAndCallForTypes<VTKM_DEFAULT_CELL_SET_LIST_STRUCTURED>(
|
||||
vtkm::worklet::contourtree_augmented::GetPointDimensions(), meshSize);
|
||||
|
||||
// Create the mesh we need for the contour tree computation so that we have access to it
|
||||
// afterwards to compute the BRACT for each data block as well
|
||||
@ -293,39 +249,30 @@ void ContourTreeUniformDistributed::ComputeLocalTree(
|
||||
vtkm::Id2{ meshSize[0], meshSize[1] });
|
||||
this->LocalMeshes[static_cast<std::size_t>(blockIndex)] = mesh;
|
||||
auto meshBoundaryExecObject = mesh.GetMeshBoundaryExecutionObject();
|
||||
this->ComputeLocalTreeImpl(
|
||||
blockIndex, input, field, fieldMeta, policy, mesh, meshBoundaryExecObject);
|
||||
this->ComputeLocalTreeImpl(blockIndex, input, fieldArray, mesh, meshBoundaryExecObject);
|
||||
}
|
||||
else if (this->UseMarchingCubes) // 3D marching cubes mesh
|
||||
{
|
||||
vtkm::worklet::contourtree_augmented::DataSetMeshTriangulation3DMarchingCubes mesh(meshSize);
|
||||
this->LocalMeshes[static_cast<std::size_t>(blockIndex)] = mesh;
|
||||
auto meshBoundaryExecObject = mesh.GetMeshBoundaryExecutionObject();
|
||||
this->ComputeLocalTreeImpl(
|
||||
blockIndex, input, field, fieldMeta, policy, mesh, meshBoundaryExecObject);
|
||||
this->ComputeLocalTreeImpl(blockIndex, input, fieldArray, mesh, meshBoundaryExecObject);
|
||||
}
|
||||
else // Regular 3D mesh
|
||||
{
|
||||
vtkm::worklet::contourtree_augmented::DataSetMeshTriangulation3DFreudenthal mesh(meshSize);
|
||||
this->LocalMeshes[static_cast<std::size_t>(blockIndex)] = mesh;
|
||||
auto meshBoundaryExecObject = mesh.GetMeshBoundaryExecutionObject();
|
||||
this->ComputeLocalTreeImpl(
|
||||
blockIndex, input, field, fieldMeta, policy, mesh, meshBoundaryExecObject);
|
||||
this->ComputeLocalTreeImpl(blockIndex, input, fieldArray, mesh, meshBoundaryExecObject);
|
||||
}
|
||||
} // ContourTreeUniformDistributed::ComputeLocalTree
|
||||
|
||||
//-----------------------------------------------------------------------------
|
||||
template <typename T,
|
||||
typename StorageType,
|
||||
typename DerivedPolicy,
|
||||
typename MeshType,
|
||||
typename MeshBoundaryExecType>
|
||||
template <typename T, typename StorageType, typename MeshType, typename MeshBoundaryExecType>
|
||||
void ContourTreeUniformDistributed::ComputeLocalTreeImpl(
|
||||
const vtkm::Id blockIndex,
|
||||
const vtkm::cont::DataSet&, // input,
|
||||
const vtkm::cont::ArrayHandle<T, StorageType>& field,
|
||||
const vtkm::filter::FieldMetadata&, // fieldMeta,
|
||||
vtkm::filter::PolicyBase<DerivedPolicy>, // policy,
|
||||
MeshType& mesh,
|
||||
MeshBoundaryExecType& meshBoundaryExecObject)
|
||||
{
|
||||
@ -522,6 +469,16 @@ void ContourTreeUniformDistributed::ComputeLocalTreeImpl(
|
||||
} // ContourTreeUniformDistributed::ComputeLocalTreeImpl
|
||||
|
||||
|
||||
vtkm::cont::DataSet ContourTreeUniformDistributed::DoExecute(const vtkm::cont::DataSet& input)
|
||||
{
|
||||
vtkm::cont::PartitionedDataSet output = this->Execute(vtkm::cont::PartitionedDataSet(input));
|
||||
if (output.GetNumberOfPartitions() > 1)
|
||||
{
|
||||
throw vtkm::cont::ErrorFilterExecution("Expecting at most 1 block.");
|
||||
}
|
||||
return output.GetNumberOfPartitions() == 1 ? output.GetPartition(0) : vtkm::cont::DataSet();
|
||||
}
|
||||
|
||||
//-----------------------------------------------------------------------------
|
||||
// Main execution phases of the filter
|
||||
//
|
||||
@ -535,10 +492,8 @@ void ContourTreeUniformDistributed::ComputeLocalTreeImpl(
|
||||
// --> DoPostExecute
|
||||
//-----------------------------------------------------------------------------
|
||||
//-----------------------------------------------------------------------------
|
||||
template <typename DerivedPolicy>
|
||||
inline VTKM_CONT void ContourTreeUniformDistributed::PreExecute(
|
||||
const vtkm::cont::PartitionedDataSet& input,
|
||||
const vtkm::filter::PolicyBase<DerivedPolicy>&)
|
||||
VTKM_CONT void ContourTreeUniformDistributed::PreExecute(
|
||||
const vtkm::cont::PartitionedDataSet& input)
|
||||
{
|
||||
if (vtkm::filter::scalar_topology::internal::SpatialDecomposition::GetGlobalNumberOfBlocks(
|
||||
input) != this->MultiBlockSpatialDecomposition.GetGlobalNumberOfBlocks())
|
||||
@ -554,31 +509,28 @@ inline VTKM_CONT void ContourTreeUniformDistributed::PreExecute(
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
template <typename DerivedPolicy>
|
||||
vtkm::cont::PartitionedDataSet ContourTreeUniformDistributed::PrepareForExecution(
|
||||
const vtkm::cont::PartitionedDataSet& input,
|
||||
const vtkm::filter::PolicyBase<DerivedPolicy>& policy)
|
||||
vtkm::cont::PartitionedDataSet ContourTreeUniformDistributed::DoExecutePartitions(
|
||||
const vtkm::cont::PartitionedDataSet& input)
|
||||
{
|
||||
// Time execution
|
||||
vtkm::cont::Timer timer;
|
||||
timer.Start();
|
||||
|
||||
this->PreExecute(input);
|
||||
|
||||
// Compute the local contour tree, boundary tree, and interior forest for each local data block
|
||||
for (vtkm::Id blockNo = 0; blockNo < input.GetNumberOfPartitions(); ++blockNo)
|
||||
{
|
||||
auto dataset = input.GetPartition(blockNo);
|
||||
auto field = dataset.GetField(this->GetActiveFieldName(), this->GetActiveFieldAssociation());
|
||||
vtkm::filter::FieldMetadata metaData(field);
|
||||
const auto& dataset = input.GetPartition(blockNo);
|
||||
const auto& field =
|
||||
dataset.GetField(this->GetActiveFieldName(), this->GetActiveFieldAssociation());
|
||||
if (!field.IsFieldPoint())
|
||||
{
|
||||
throw vtkm::cont::ErrorFilterExecution("Point field expected.");
|
||||
}
|
||||
|
||||
vtkm::filter::FilterTraits<ContourTreeUniformDistributed> traits;
|
||||
vtkm::cont::CastAndCall(vtkm::filter::ApplyPolicyFieldActive(field, policy, traits),
|
||||
vtkm::filter::contourtree_distributed_detail::ComputeLocalTree{},
|
||||
this,
|
||||
blockNo,
|
||||
dataset,
|
||||
metaData,
|
||||
policy);
|
||||
this->CastAndCallScalarField(
|
||||
field, [&](const auto concrete) { this->ComputeLocalTree(blockNo, dataset, concrete); });
|
||||
}
|
||||
|
||||
// Log sizes of the local contour trees, boundary trees, and interior forests
|
||||
@ -614,18 +566,20 @@ vtkm::cont::PartitionedDataSet ContourTreeUniformDistributed::PrepareForExecutio
|
||||
<< " " << std::setw(38) << std::left << "Contour Tree Filter PrepareForExecution"
|
||||
<< ": " << timer.GetElapsedTime() << " seconds");
|
||||
|
||||
return input; // TODO/FIXME: What to return?
|
||||
vtkm::cont::PartitionedDataSet result;
|
||||
this->PostExecute(input, result);
|
||||
|
||||
return result;
|
||||
}
|
||||
|
||||
//-----------------------------------------------------------------------------
|
||||
template <typename DerivedPolicy>
|
||||
inline VTKM_CONT void ContourTreeUniformDistributed::PostExecute(
|
||||
VTKM_CONT void ContourTreeUniformDistributed::PostExecute(
|
||||
const vtkm::cont::PartitionedDataSet& input,
|
||||
vtkm::cont::PartitionedDataSet& result,
|
||||
const vtkm::filter::PolicyBase<DerivedPolicy>& policy)
|
||||
vtkm::cont::PartitionedDataSet& result)
|
||||
{
|
||||
vtkm::cont::Timer timer;
|
||||
timer.Start();
|
||||
|
||||
// We are running in parallel and need to merge the contour tree in PostExecute
|
||||
// TODO/FIXME: This filter should only be used in a parallel setting with more
|
||||
// than one block. Is there a better way to enforce this? thrown an exception
|
||||
@ -634,18 +588,15 @@ inline VTKM_CONT void ContourTreeUniformDistributed::PostExecute(
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
auto field = // TODO/FIXME: Correct for more than one block per rank?
|
||||
input.GetPartition(0).GetField(this->GetActiveFieldName(), this->GetActiveFieldAssociation());
|
||||
vtkm::filter::FieldMetadata metaData(field);
|
||||
|
||||
vtkm::filter::FilterTraits<ContourTreeUniformDistributed> traits;
|
||||
vtkm::cont::CastAndCall(vtkm::filter::ApplyPolicyFieldActive(field, policy, traits),
|
||||
vtkm::filter::contourtree_distributed_detail::PostExecuteCaller{},
|
||||
this,
|
||||
input,
|
||||
result,
|
||||
metaData,
|
||||
policy);
|
||||
auto PostExecuteCaller = [&](const auto& concrete) {
|
||||
using T = typename std::decay_t<decltype(concrete)>::ValueType;
|
||||
this->DoPostExecute<T>(input, result);
|
||||
};
|
||||
this->CastAndCallScalarField(field, PostExecuteCaller);
|
||||
|
||||
VTKM_LOG_S(this->TimingsLogLevel,
|
||||
std::endl
|
||||
@ -858,13 +809,10 @@ inline VTKM_CONT void ContourTreeUniformDistributed::ComputeVolumeMetric(
|
||||
}
|
||||
|
||||
//-----------------------------------------------------------------------------
|
||||
template <typename FieldType, typename StorageType, typename DerivedPolicy>
|
||||
template <typename FieldType>
|
||||
VTKM_CONT void ContourTreeUniformDistributed::DoPostExecute(
|
||||
const vtkm::cont::PartitionedDataSet& input,
|
||||
vtkm::cont::PartitionedDataSet& result,
|
||||
const vtkm::filter::FieldMetadata&, // dummy parameter for field meta data
|
||||
const vtkm::cont::ArrayHandle<FieldType, StorageType>&, // dummy parameter to get the type
|
||||
vtkm::filter::PolicyBase<DerivedPolicy>) // dummy parameter for policy
|
||||
vtkm::cont::PartitionedDataSet& result)
|
||||
{
|
||||
vtkm::cont::Timer timer;
|
||||
timer.Start();
|
||||
@ -1109,7 +1057,7 @@ VTKM_CONT void ContourTreeUniformDistributed::DoPostExecute(
|
||||
// save the corresponding .gv file
|
||||
if (this->SaveDotFiles)
|
||||
{
|
||||
vtkm::filter::contourtree_distributed_detail::SaveHierarchicalTreeDot(
|
||||
vtkm::filter::scalar_topology::contourtree_distributed_detail::SaveHierarchicalTreeDot(
|
||||
blockData, rank, nRounds);
|
||||
} // if(this->SaveDotFiles)
|
||||
|
||||
@ -1131,7 +1079,7 @@ VTKM_CONT void ContourTreeUniformDistributed::DoPostExecute(
|
||||
// save the corresponding .gv file
|
||||
if (this->SaveDotFiles)
|
||||
{
|
||||
vtkm::filter::contourtree_distributed_detail::SaveHierarchicalTreeDot(
|
||||
vtkm::filter::scalar_topology::contourtree_distributed_detail::SaveHierarchicalTreeDot(
|
||||
blockData, rank, nRounds);
|
||||
} // if(this->SaveDotFiles)
|
||||
// Log the time for each of the iterations of the fan out loop
|
||||
@ -1257,7 +1205,7 @@ VTKM_CONT void ContourTreeUniformDistributed::DoPostExecute(
|
||||
if (this->SaveDotFiles)
|
||||
{
|
||||
auto nRounds = blockData->ContourTrees.size() - 1;
|
||||
vtkm::filter::contourtree_distributed_detail::SaveHierarchicalTreeDot(
|
||||
vtkm::filter::scalar_topology::contourtree_distributed_detail::SaveHierarchicalTreeDot(
|
||||
blockData, rank, nRounds);
|
||||
|
||||
createOutdataTimingsStream << " Save Dot (block=" << blockData->LocalBlockNo
|
||||
@ -1302,7 +1250,6 @@ VTKM_CONT void ContourTreeUniformDistributed::DoPostExecute(
|
||||
result = vtkm::cont::PartitionedDataSet(hierarchicalTreeOutputDataSet);
|
||||
} // DoPostExecute
|
||||
|
||||
} // namespace scalar_topology
|
||||
} // namespace filter
|
||||
} // namespace vtkm::filter
|
||||
|
||||
#endif
|
265
vtkm/filter/scalar_topology/ContourTreeUniformDistributed.h
Normal file
265
vtkm/filter/scalar_topology/ContourTreeUniformDistributed.h
Normal file
@ -0,0 +1,265 @@
|
||||
//============================================================================
|
||||
// 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 (c) 2018, The Regents of the University of California, through
|
||||
// Lawrence Berkeley National Laboratory (subject to receipt of any required approvals
|
||||
// from the U.S. Dept. of Energy). All rights reserved.
|
||||
//
|
||||
// Redistribution and use in source and binary forms, with or without modification,
|
||||
// are permitted provided that the following conditions are met:
|
||||
//
|
||||
// (1) Redistributions of source code must retain the above copyright notice, this
|
||||
// list of conditions and the following disclaimer.
|
||||
//
|
||||
// (2) Redistributions in binary form must reproduce the above copyright notice,
|
||||
// this list of conditions and the following disclaimer in the documentation
|
||||
// and/or other materials provided with the distribution.
|
||||
//
|
||||
// (3) Neither the name of the University of California, Lawrence Berkeley National
|
||||
// Laboratory, U.S. Dept. of Energy nor the names of its contributors may be
|
||||
// used to endorse or promote products derived from this software without
|
||||
// specific prior written permission.
|
||||
//
|
||||
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
||||
// ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
||||
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
||||
// IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
|
||||
// INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
|
||||
// BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
|
||||
// OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
|
||||
// OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
//
|
||||
//=============================================================================
|
||||
//
|
||||
// This code is an extension of the algorithm presented in the paper:
|
||||
// Parallel Peak Pruning for Scalable SMP Contour Tree Computation.
|
||||
// Hamish Carr, Gunther Weber, Christopher Sewell, and James Ahrens.
|
||||
// Proceedings of the IEEE Symposium on Large Data Analysis and Visualization
|
||||
// (LDAV), October 2016, Baltimore, Maryland.
|
||||
//
|
||||
// The PPP2 algorithm and software were jointly developed by
|
||||
// Hamish Carr (University of Leeds), Gunther H. Weber (LBNL), and
|
||||
// Oliver Ruebel (LBNL)
|
||||
//==============================================================================
|
||||
|
||||
|
||||
#ifndef vtk_m_filter_scalar_topology_ContourTreeUniformDistributed_h
|
||||
#define vtk_m_filter_scalar_topology_ContourTreeUniformDistributed_h
|
||||
|
||||
#include <vtkm/Types.h>
|
||||
#include <vtkm/cont/ArrayHandle.h>
|
||||
#include <vtkm/filter/scalar_topology/internal/SpatialDecomposition.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/ContourTree.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/DataSetMesh.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/BoundaryTree.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/HierarchicalContourTree.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/InteriorForest.h>
|
||||
|
||||
#include <memory>
|
||||
#include <vtkm/filter/NewFilterField.h>
|
||||
#include <vtkm/filter/scalar_topology/vtkm_filter_scalar_topology_export.h>
|
||||
|
||||
namespace vtkm
|
||||
{
|
||||
namespace filter
|
||||
{
|
||||
namespace scalar_topology
|
||||
{
|
||||
/// \brief Construct the Contour Tree for a 2D or 3D regular mesh
|
||||
///
|
||||
/// This filter implements the parallel peak pruning algorithm. In contrast to
|
||||
/// the ContourTreeUniform filter, this filter is optimized to allow for the
|
||||
/// computation of the augmented contour tree, i.e., the contour tree including
|
||||
/// all regular mesh vertices. Augmentation with regular vertices is used in
|
||||
/// practice to compute statistics (e.g., volume), to segment the input mesh,
|
||||
/// facilitate iso-value selection, enable localization of all verticies of a
|
||||
/// mesh in the tree among others.
|
||||
///
|
||||
/// In addition to single-block computation, the filter also supports multi-block
|
||||
/// regular grids. The blocks are processed in parallel using DIY and then the
|
||||
/// tree are merged progressively using a binary-reduction scheme to compute the
|
||||
/// final contour tree. I.e., in the multi-block context, the final tree is
|
||||
/// constructed on rank 0.
|
||||
class VTKM_FILTER_SCALAR_TOPOLOGY_EXPORT ContourTreeUniformDistributed
|
||||
: public vtkm::filter::NewFilterField
|
||||
{
|
||||
public:
|
||||
VTKM_CONT bool CanThread() const override
|
||||
{
|
||||
// tons of shared mutable states
|
||||
return false;
|
||||
}
|
||||
|
||||
///
|
||||
/// Create the contour tree filter
|
||||
/// @param[in] blocksPerDim Number of data blocks used in each data dimension
|
||||
/// @param[in] globalSize Global extends of the input mesh (i.e., number of mesh points in each dimension)
|
||||
/// @param[in] localBlockIndices Array with the (x,y,z) index of each local data block with
|
||||
/// with respect to blocksPerDim
|
||||
/// @param[in] localBlockOrigins Array with the (x,y,z) origin (with regard to mesh index) of each
|
||||
/// local data block
|
||||
/// @param[in] localBlockSizes Array with the sizes (i.e., extends in number of mesh points) of each
|
||||
/// local data block
|
||||
/// @param[in] useMarchingCubes Boolean indicating whether marching cubes (true) or freudenthal (false)
|
||||
/// connectivity should be used. Valid only for 3D input data. Default is false.
|
||||
/// @param[in] saveDotFiles Save debug dot output files for the distributed contour tree compute.
|
||||
/// @param[in] timingsLogLevel Set the vtkm::cont:LogLevel to be used to record timings information
|
||||
/// specific to the computation of the hierachical contour tree
|
||||
/// @param[in] treeLogLevel Set the vtkm::cont:LogLevel to be used to record metadata information
|
||||
/// about the various trees computed as part of the hierarchical contour tree compute
|
||||
VTKM_CONT
|
||||
VTKM_DEPRECATED(1.8,
|
||||
"ContourTreeUniformDistributed no longer requires flags as part of constructor. "
|
||||
"Use appropriate Set<X> methods.")
|
||||
ContourTreeUniformDistributed(
|
||||
vtkm::Id3 blocksPerDim, // TODO/FIXME: Possibly pass SpatialDecomposition object instead
|
||||
vtkm::Id3 globalSize,
|
||||
const vtkm::cont::ArrayHandle<vtkm::Id3>& localBlockIndices,
|
||||
const vtkm::cont::ArrayHandle<vtkm::Id3>& localBlockOrigins,
|
||||
const vtkm::cont::ArrayHandle<vtkm::Id3>& localBlockSizes,
|
||||
bool useBoundaryExtremaOnly = true,
|
||||
bool useMarchingCubes = false,
|
||||
bool augmentHierarchicalTree = false,
|
||||
bool saveDotFiles = false,
|
||||
vtkm::cont::LogLevel timingsLogLevel = vtkm::cont::LogLevel::Perf,
|
||||
vtkm::cont::LogLevel treeLogLevel = vtkm::cont::LogLevel::Info);
|
||||
|
||||
VTKM_CONT
|
||||
ContourTreeUniformDistributed(
|
||||
vtkm::Id3 blocksPerDim, // TODO/FIXME: Possibly pass SpatialDecomposition object instead
|
||||
vtkm::Id3 globalSize,
|
||||
const vtkm::cont::ArrayHandle<vtkm::Id3>& localBlockIndices,
|
||||
const vtkm::cont::ArrayHandle<vtkm::Id3>& localBlockOrigins,
|
||||
const vtkm::cont::ArrayHandle<vtkm::Id3>& localBlockSizes,
|
||||
vtkm::cont::LogLevel timingsLogLevel = vtkm::cont::LogLevel::Perf,
|
||||
vtkm::cont::LogLevel treeLogLevel = vtkm::cont::LogLevel::Info);
|
||||
|
||||
VTKM_CONT void SetUseBoundaryExtremaOnly(bool useBoundaryExtremaOnly)
|
||||
{
|
||||
this->UseBoundaryExtremaOnly = useBoundaryExtremaOnly;
|
||||
}
|
||||
|
||||
VTKM_CONT bool GetUseBoundaryExtremaOnly() { return this->UseBoundaryExtremaOnly; }
|
||||
|
||||
VTKM_CONT void SetUseMarchingCubes(bool useMarchingCubes)
|
||||
{
|
||||
this->UseMarchingCubes = useMarchingCubes;
|
||||
}
|
||||
|
||||
VTKM_CONT bool GetUseMarchingCubes() { return this->UseMarchingCubes; }
|
||||
|
||||
VTKM_CONT void SetAugmentHierarchicalTree(bool augmentHierarchicalTree)
|
||||
{
|
||||
this->AugmentHierarchicalTree = augmentHierarchicalTree;
|
||||
}
|
||||
|
||||
VTKM_CONT bool GetAugmentHierarchicalTree() { return this->AugmentHierarchicalTree; }
|
||||
|
||||
VTKM_CONT void SetSaveDotFiles(bool saveDotFiles) { this->SaveDotFiles = saveDotFiles; }
|
||||
|
||||
VTKM_CONT bool GetSaveDotFiles() { return this->SaveDotFiles; }
|
||||
|
||||
template <typename T, typename StorageType>
|
||||
VTKM_CONT void ComputeLocalTree(const vtkm::Id blockIndex,
|
||||
const vtkm::cont::DataSet& input,
|
||||
const vtkm::cont::ArrayHandle<T, StorageType>& fieldArray);
|
||||
|
||||
/// Implement per block contour tree computation after the MeshType has been discovered
|
||||
template <typename T, typename StorageType, typename MeshType, typename MeshBoundaryExecType>
|
||||
VTKM_CONT void ComputeLocalTreeImpl(const vtkm::Id blockIndex,
|
||||
const vtkm::cont::DataSet& input,
|
||||
const vtkm::cont::ArrayHandle<T, StorageType>& field,
|
||||
MeshType& mesh,
|
||||
MeshBoundaryExecType& meshBoundaryExecObject);
|
||||
|
||||
private:
|
||||
VTKM_CONT vtkm::cont::DataSet DoExecute(const vtkm::cont::DataSet& input) override;
|
||||
VTKM_CONT vtkm::cont::PartitionedDataSet DoExecutePartitions(
|
||||
const vtkm::cont::PartitionedDataSet& input) override;
|
||||
|
||||
//@{
|
||||
/// when operating on vtkm::cont::MultiBlock we want to
|
||||
/// do processing across ranks as well. Just adding pre/post handles
|
||||
/// for the same does the trick.
|
||||
VTKM_CONT void PreExecute(const vtkm::cont::PartitionedDataSet& input);
|
||||
|
||||
VTKM_CONT void PostExecute(const vtkm::cont::PartitionedDataSet& input,
|
||||
vtkm::cont::PartitionedDataSet& output);
|
||||
|
||||
|
||||
template <typename FieldType>
|
||||
VTKM_CONT void ComputeVolumeMetric(
|
||||
vtkmdiy::Master& inputContourTreeMaster,
|
||||
vtkmdiy::DynamicAssigner& assigner,
|
||||
vtkmdiy::RegularSwapPartners& partners,
|
||||
const FieldType&, // dummy parameter to get the type
|
||||
std::stringstream& timingsStream,
|
||||
std::vector<vtkm::cont::DataSet>& hierarchicalTreeOutputDataSet);
|
||||
|
||||
///
|
||||
/// Internal helper function that implements the actual functionality of PostExecute
|
||||
///
|
||||
/// In the case we operate on vtkm::cont::MultiBlock we need to merge the trees
|
||||
/// computed on the block to compute the final contour tree.
|
||||
template <typename T>
|
||||
VTKM_CONT void DoPostExecute(const vtkm::cont::PartitionedDataSet& input,
|
||||
vtkm::cont::PartitionedDataSet& output);
|
||||
//@}
|
||||
|
||||
/// Use only boundary critical points in the parallel merge to reduce communication.
|
||||
/// Disabling this should only be needed for performance testing.
|
||||
bool UseBoundaryExtremaOnly;
|
||||
|
||||
/// Use marching cubes connectivity for computing the contour tree
|
||||
bool UseMarchingCubes;
|
||||
|
||||
/// Augment hierarchical tree
|
||||
bool AugmentHierarchicalTree;
|
||||
|
||||
/// Save dot files for all tree computations
|
||||
bool SaveDotFiles;
|
||||
|
||||
/// Log level to be used for outputting timing information. Default is vtkm::cont::LogLevel::Perf
|
||||
vtkm::cont::LogLevel TimingsLogLevel = vtkm::cont::LogLevel::Perf;
|
||||
|
||||
/// Log level to be used for outputting metadata about the trees. Default is vtkm::cont::LogLevel::Info
|
||||
vtkm::cont::LogLevel TreeLogLevel = vtkm::cont::LogLevel::Info;
|
||||
|
||||
/// Information about the spatial decomposition
|
||||
vtkm::filter::scalar_topology::internal::SpatialDecomposition MultiBlockSpatialDecomposition;
|
||||
|
||||
/// Intermediate results (one per local data block)...
|
||||
/// ... local mesh information needed at end of fan out
|
||||
std::vector<vtkm::worklet::contourtree_augmented::DataSetMesh> LocalMeshes;
|
||||
/// ... local contour trees etc. computed during fan in and used during fan out
|
||||
std::vector<vtkm::worklet::contourtree_augmented::ContourTree> LocalContourTrees;
|
||||
std::vector<vtkm::worklet::contourtree_distributed::BoundaryTree> LocalBoundaryTrees;
|
||||
std::vector<vtkm::worklet::contourtree_distributed::InteriorForest> LocalInteriorForests;
|
||||
|
||||
/// The hierarchical trees computed by the filter (array with one entry per block)
|
||||
// TODO/FIXME: We need to find a way to store the final hieararchical trees somewhere.
|
||||
// Currently we cannot do this here as it is a template on FieldType
|
||||
//
|
||||
//std::vector<vtkm::worklet::contourtree_distributed::HierarchicalContourTree> HierarchicalContourTrees;
|
||||
/// Number of iterations used to compute the contour tree
|
||||
vtkm::Id NumIterations;
|
||||
};
|
||||
} // namespace scalar_topology
|
||||
class VTKM_DEPRECATED(1.8, "Use vtkm::filter::scalar_topology::ContourTreeUniformDistributed.")
|
||||
ContourTreeUniformDistributed
|
||||
: public vtkm::filter::scalar_topology::ContourTreeUniformDistributed
|
||||
{
|
||||
using scalar_topology::ContourTreeUniformDistributed::ContourTreeUniformDistributed;
|
||||
};
|
||||
} // namespace filter
|
||||
} // namespace vtkm
|
||||
|
||||
#endif // vtk_m_filter_scalar_topology_ContourTreeUniformDistributed_h
|
@ -10,10 +10,19 @@
|
||||
##
|
||||
##=============================================================================
|
||||
|
||||
set(headers
|
||||
SuperArcHelper.h
|
||||
TestingContourTreeUniformDistributedFilter.h
|
||||
VolumeHelper.h
|
||||
)
|
||||
|
||||
#vtkm_declare_headers(${headers})
|
||||
|
||||
set(unit_tests
|
||||
UnitTestContourTreeUniformFilter.cxx
|
||||
UnitTestContourTreeUniformAugmentedFilter.cxx
|
||||
UnitTestContourTreeUniformAugmentedWorklet.cxx
|
||||
UnitTestContourTreeUniformDistributedFilter.cxx
|
||||
UnitTestDistributedBranchDecompositionFilter.cxx
|
||||
)
|
||||
|
||||
@ -29,3 +38,15 @@ vtkm_unit_tests(
|
||||
ALL_BACKENDS # includes Worklet unit test and uses vtkm::cont::Algorithm
|
||||
USE_VTKM_JOB_POOL
|
||||
)
|
||||
|
||||
if (VTKm_ENABLE_MPI)
|
||||
set(mpi_unit_tests
|
||||
UnitTestContourTreeUniformDistributedFilterMPI.cxx
|
||||
)
|
||||
vtkm_unit_tests(
|
||||
MPI SOURCES ${mpi_unit_tests}
|
||||
LIBRARIES vtkm_filter vtkm_source vtkm_io
|
||||
ALL_BACKENDS
|
||||
USE_VTKM_JOB_POOL
|
||||
)
|
||||
endif()
|
||||
|
@ -54,7 +54,6 @@
|
||||
#define _vtk_m_filter_testing_SuperArchHelper_h_
|
||||
|
||||
#include <algorithm>
|
||||
#include <vtkm/Types.h>
|
||||
|
||||
namespace vtkm
|
||||
{
|
@ -60,17 +60,17 @@
|
||||
#include <vtkm/cont/Serialization.h>
|
||||
#include <vtkm/cont/testing/MakeTestDataSet.h>
|
||||
#include <vtkm/cont/testing/Testing.h>
|
||||
#include <vtkm/filter/ContourTreeUniformDistributed.h>
|
||||
#include <vtkm/filter/MapFieldPermutation.h>
|
||||
#include <vtkm/filter/scalar_topology/ContourTreeUniformDistributed.h>
|
||||
#include <vtkm/filter/scalar_topology/DistributedBranchDecompositionFilter.h>
|
||||
#include <vtkm/filter/scalar_topology/testing/SuperArcHelper.h>
|
||||
#include <vtkm/filter/scalar_topology/testing/VolumeHelper.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/branch_decomposition/HierarchicalVolumetricBranchDecomposer.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/Types.h>
|
||||
#include <vtkm/filter/testing/SuperArcHelper.h>
|
||||
#include <vtkm/filter/testing/VolumeHelper.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/BranchCompiler.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/TreeCompiler.h>
|
||||
#include <vtkm/io/ErrorIO.h>
|
||||
#include <vtkm/io/VTKDataSetReader.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/BranchCompiler.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/TreeCompiler.h>
|
||||
|
||||
namespace vtkm
|
||||
{
|
||||
@ -289,13 +289,14 @@ inline vtkm::cont::PartitionedDataSet RunContourTreeDUniformDistributed(
|
||||
}
|
||||
|
||||
// Run the contour tree analysis
|
||||
vtkm::filter::ContourTreeUniformDistributed filter(blocksPerAxis,
|
||||
globalSize,
|
||||
localBlockIndices,
|
||||
localBlockOrigins,
|
||||
localBlockSizes,
|
||||
vtkm::cont::LogLevel::UserVerboseLast,
|
||||
vtkm::cont::LogLevel::UserVerboseLast);
|
||||
vtkm::filter::scalar_topology::ContourTreeUniformDistributed filter(
|
||||
blocksPerAxis,
|
||||
globalSize,
|
||||
localBlockIndices,
|
||||
localBlockOrigins,
|
||||
localBlockSizes,
|
||||
vtkm::cont::LogLevel::UserVerboseLast,
|
||||
vtkm::cont::LogLevel::UserVerboseLast);
|
||||
|
||||
filter.SetUseMarchingCubes(useMarchingCubes);
|
||||
// Freudenthal: Only use boundary extrema; MC: use all points on boundary
|
||||
@ -324,9 +325,7 @@ inline vtkm::cont::PartitionedDataSet RunContourTreeDUniformDistributed(
|
||||
{
|
||||
// Mutiple ranks -> Some assembly required. Collect data
|
||||
// on rank 0, all other ranks return empty data sets
|
||||
using FieldTypeList =
|
||||
vtkm::ListAppend<vtkm::filter::ContourTreeUniformDistributed::SupportedTypes,
|
||||
vtkm::List<vtkm::Id>>;
|
||||
using FieldTypeList = vtkm::ListAppend<vtkm::TypeListScalarAll, vtkm::List<vtkm::Id>>;
|
||||
using DataSetWrapper =
|
||||
vtkm::cont::SerializableDataSet<FieldTypeList, vtkm::cont::CellSetListStructured>;
|
||||
|
||||
@ -364,7 +363,7 @@ inline vtkm::cont::PartitionedDataSet RunContourTreeDUniformDistributed(
|
||||
for (vtkm::Id currReceiveDataSetNo = 0; currReceiveDataSetNo < numberOfDataSetsToReceive;
|
||||
++currReceiveDataSetNo)
|
||||
{
|
||||
auto sds = vtkm::filter::MakeSerializableDataSet(filter);
|
||||
vtkm::cont::SerializableDataSet<> sds;
|
||||
p.dequeue({ receiveFromRank, receiveFromRank }, sds);
|
||||
combined_result.AppendPartition(sds.DataSet);
|
||||
}
|
@ -50,7 +50,7 @@
|
||||
// Oliver Ruebel (LBNL)
|
||||
//==============================================================================
|
||||
|
||||
#include <vtkm/filter/testing/TestingContourTreeUniformDistributedFilter.h>
|
||||
#include "TestingContourTreeUniformDistributedFilter.h"
|
||||
|
||||
namespace
|
||||
{
|
||||
|
@ -18,3 +18,4 @@ vtkm_declare_headers(${headers})
|
||||
add_subdirectory(branch_decomposition)
|
||||
add_subdirectory(contourtree)
|
||||
add_subdirectory(contourtree_augmented)
|
||||
add_subdirectory(contourtree_distributed)
|
@ -123,9 +123,9 @@
|
||||
#include <string>
|
||||
|
||||
// Contour tree includes, not yet moved into new filter structure
|
||||
#include <vtkm/worklet/contourtree_distributed/PrintGraph.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_contour_tree/FindRegularByGlobal.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_contour_tree/FindSuperArcBetweenNodes.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/PrintGraph.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_contour_tree/FindRegularByGlobal.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_contour_tree/FindSuperArcBetweenNodes.h>
|
||||
|
||||
// Worklets
|
||||
#include <vtkm/filter/scalar_topology/worklet/branch_decomposition/hierarchical_volumetric_branch_decomposer/CollapseBranchesPointerDoublingWorklet.h>
|
||||
|
@ -60,37 +60,37 @@
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/data_set_mesh/IdRelabeler.h>
|
||||
|
||||
// distibuted contour tree includes
|
||||
#include <vtkm/worklet/contourtree_distributed/BoundaryTree.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/HierarchicalContourTree.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/InteriorForest.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/BoundaryTree.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/HierarchicalContourTree.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/InteriorForest.h>
|
||||
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/AddTerminalFlagsToUpDownNeighboursWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/AugmentBoundaryWithNecessaryInteriorSupernodesAppendNecessarySupernodesWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/AugmentBoundaryWithNecessaryInteriorSupernodesUnsetBoundarySupernodesWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/BoundaryTreeNodeComparator.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/BoundaryVerticesPerSuperArcWorklets.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/CompressRegularisedNodesCopyNecessaryRegularNodesWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/CompressRegularisedNodesFillBoundaryTreeSuperarcsWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/CompressRegularisedNodesFindNewSuperarcsWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/CompressRegularisedNodesResolveRootWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/CompressRegularisedNodesTransferVerticesWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/ContourTreeNodeHyperArcComparator.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/FindBoundaryTreeSuperarcsSuperarcToWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/FindBoundaryVerticesIsNecessaryWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/FindNecessaryInteriorSetSuperparentNecessaryWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/FindNecessaryInteriorSupernodesFindNodesWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/HyperarcComparator.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/IdentifyRegularisedSupernodesStepOneWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/IdentifyRegularisedSupernodesStepTwoWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/NoSuchElementFunctor.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/PointerDoubleUpDownNeighboursWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/PropagateBoundaryCountsComputeGroupTotalsWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/PropagateBoundaryCountsSubtractDependentCountsWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/PropagateBoundaryCountsTransferCumulativeCountsWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/PropagateBoundaryCountsTransferDependentCountsWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/SetInteriorForestWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/SetUpAndDownNeighboursWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/boundary_tree_maker/SumFunctor.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/AddTerminalFlagsToUpDownNeighboursWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/AugmentBoundaryWithNecessaryInteriorSupernodesAppendNecessarySupernodesWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/AugmentBoundaryWithNecessaryInteriorSupernodesUnsetBoundarySupernodesWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/BoundaryTreeNodeComparator.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/BoundaryVerticesPerSuperArcWorklets.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/CompressRegularisedNodesCopyNecessaryRegularNodesWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/CompressRegularisedNodesFillBoundaryTreeSuperarcsWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/CompressRegularisedNodesFindNewSuperarcsWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/CompressRegularisedNodesResolveRootWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/CompressRegularisedNodesTransferVerticesWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/ContourTreeNodeHyperArcComparator.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/FindBoundaryTreeSuperarcsSuperarcToWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/FindBoundaryVerticesIsNecessaryWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/FindNecessaryInteriorSetSuperparentNecessaryWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/FindNecessaryInteriorSupernodesFindNodesWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/HyperarcComparator.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/IdentifyRegularisedSupernodesStepOneWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/IdentifyRegularisedSupernodesStepTwoWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/NoSuchElementFunctor.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/PointerDoubleUpDownNeighboursWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/PropagateBoundaryCountsComputeGroupTotalsWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/PropagateBoundaryCountsSubtractDependentCountsWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/PropagateBoundaryCountsTransferCumulativeCountsWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/PropagateBoundaryCountsTransferDependentCountsWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/SetInteriorForestWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/SetUpAndDownNeighboursWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/boundary_tree_maker/SumFunctor.h>
|
||||
|
||||
|
||||
// vtkm includes
|
@ -56,7 +56,7 @@
|
||||
#include <vtkm/Types.h>
|
||||
#include <vtkm/cont/ArrayGetValues.h>
|
||||
#include <vtkm/cont/ArrayHandle.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/HyperSweepBlock.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/HyperSweepBlock.h>
|
||||
|
||||
// clang-format off
|
||||
VTKM_THIRDPARTY_PRE_INCLUDE
|
@ -57,8 +57,8 @@
|
||||
#include <vtkm/cont/Error.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/ContourTreeUniformAugmented.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/Types.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/DistributedContourTreeBlockData.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/PrintGraph.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/DistributedContourTreeBlockData.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/PrintGraph.h>
|
||||
|
||||
// clang-format off
|
||||
VTKM_THIRDPARTY_PRE_INCLUDE
|
@ -56,8 +56,8 @@
|
||||
#include <vtkm/Types.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/Types.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/meshtypes/ContourTreeMesh.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/HierarchicalAugmenter.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/HierarchicalContourTree.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/HierarchicalAugmenter.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/HierarchicalContourTree.h>
|
||||
|
||||
// clang-format off
|
||||
VTKM_THIRDPARTY_PRE_INCLUDE
|
@ -96,23 +96,23 @@
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/NotNoSuchElementPredicate.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/PrintVectors.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/Types.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/PrintGraph.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_augmenter/AttachmentAndSupernodeComparator.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_augmenter/AttachmentIdsEqualComparator.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_augmenter/AttachmentSuperparentAndIndexComparator.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_augmenter/CopyBaseRegularStructureWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_augmenter/CreateSuperarcsWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_augmenter/FindSuperparentForNecessaryNodesWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_augmenter/HierarchicalAugmenterInOutData.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_augmenter/IsAscendingDecorator.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_augmenter/IsAttachementPointNeededPredicate.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_augmenter/IsAttachementPointPredicate.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_augmenter/ResizeArraysBuildNewSupernodeIdsWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_augmenter/SetFirstAttachmentPointInRoundWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_augmenter/SetSuperparentSetDecorator.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_augmenter/UpdateHyperstructureSetHyperarcsAndNodesWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_augmenter/UpdateHyperstructureSetSuperchildrenWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_contour_tree/PermuteComparator.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/PrintGraph.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_augmenter/AttachmentAndSupernodeComparator.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_augmenter/AttachmentIdsEqualComparator.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_augmenter/AttachmentSuperparentAndIndexComparator.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_augmenter/CopyBaseRegularStructureWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_augmenter/CreateSuperarcsWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_augmenter/FindSuperparentForNecessaryNodesWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_augmenter/HierarchicalAugmenterInOutData.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_augmenter/IsAscendingDecorator.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_augmenter/IsAttachementPointNeededPredicate.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_augmenter/IsAttachementPointPredicate.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_augmenter/ResizeArraysBuildNewSupernodeIdsWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_augmenter/SetFirstAttachmentPointInRoundWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_augmenter/SetSuperparentSetDecorator.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_augmenter/UpdateHyperstructureSetHyperarcsAndNodesWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_augmenter/UpdateHyperstructureSetSuperchildrenWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_contour_tree/PermuteComparator.h>
|
||||
|
||||
|
||||
namespace vtkm
|
@ -55,8 +55,8 @@
|
||||
|
||||
#include <vtkm/Types.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/Types.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/DistributedContourTreeBlockData.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/PrintGraph.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/DistributedContourTreeBlockData.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/PrintGraph.h>
|
||||
|
||||
// clang-format off
|
||||
VTKM_THIRDPARTY_PRE_INCLUDE
|
@ -76,11 +76,11 @@
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/ContourTree.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/Types.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/meshtypes/ContourTreeMesh.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_contour_tree/FindRegularByGlobal.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_contour_tree/FindSuperArcBetweenNodes.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_contour_tree/FindSuperArcForUnknownNode.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_contour_tree/InitalizeSuperchildrenWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_contour_tree/PermuteComparator.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_contour_tree/FindRegularByGlobal.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_contour_tree/FindSuperArcBetweenNodes.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_contour_tree/FindSuperArcForUnknownNode.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_contour_tree/InitalizeSuperchildrenWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_contour_tree/PermuteComparator.h>
|
||||
|
||||
namespace vtkm
|
||||
{
|
@ -82,16 +82,16 @@
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/PrintVectors.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/Types.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/data_set_mesh/IdRelabeler.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/HierarchicalContourTree.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/PrintGraph.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_hyper_sweeper/ComputeSuperarcDependentWeightsWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_hyper_sweeper/ComputeSuperarcTransferWeightsWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_hyper_sweeper/InitializeIntrinsicVertexCountComputeSuperparentIdsWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_hyper_sweeper/InitializeIntrinsicVertexCountInitalizeCountsWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_hyper_sweeper/InitializeIntrinsicVertexCountSubtractLowEndWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_hyper_sweeper/TransferTargetComperator.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_hyper_sweeper/TransferWeightsUpdateLHEWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/hierarchical_hyper_sweeper/TransferWeightsUpdateRHEWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/HierarchicalContourTree.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/PrintGraph.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_hyper_sweeper/ComputeSuperarcDependentWeightsWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_hyper_sweeper/ComputeSuperarcTransferWeightsWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_hyper_sweeper/InitializeIntrinsicVertexCountComputeSuperparentIdsWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_hyper_sweeper/InitializeIntrinsicVertexCountInitalizeCountsWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_hyper_sweeper/InitializeIntrinsicVertexCountSubtractLowEndWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_hyper_sweeper/TransferTargetComperator.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_hyper_sweeper/TransferWeightsUpdateLHEWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/hierarchical_hyper_sweeper/TransferWeightsUpdateRHEWorklet.h>
|
||||
|
||||
|
||||
namespace vtkm
|
@ -55,7 +55,7 @@
|
||||
|
||||
#include <vtkm/Types.h>
|
||||
#include <vtkm/cont/ArrayHandle.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/HierarchicalContourTree.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/HierarchicalContourTree.h>
|
||||
|
||||
namespace vtkm
|
||||
{
|
@ -100,9 +100,9 @@
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/ContourTree.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/Types.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/meshtypes/ContourTreeMesh.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/BoundaryTree.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/HierarchicalContourTree.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/InteriorForest.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/BoundaryTree.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/HierarchicalContourTree.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/InteriorForest.h>
|
||||
|
||||
namespace vtkm
|
||||
{
|
@ -64,32 +64,32 @@
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/Types.h>
|
||||
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/ContourTree.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/HierarchicalContourTree.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/InteriorForest.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/CalculateAttachementCounterWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/CollapseRegularChainsWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/CopyFirstHypernodePerIterationWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/CopyFirstSupernodePerIterationWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/CopyNewHypernodesWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/CopyNewNodesSetSuperparentsWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/CopyNewSupernodesSetSuperchildrenWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/CopyNewSupernodesWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/FindCriticalPointsFindLeafsWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/FindCriticalPointsFindSaddlesWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/FindCriticalPointsFindTerminalElementsWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/FindCriticalPointsSetUpDownNeighboursWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/GetHierarchicalIdsWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/GraftInteriorForestsSetTransferIterationWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/HyperNodeWhenComparator.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/IdentifyLeafHyperarcsWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/InitActiceSuperarcIdWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/InitActiceSuperarcsWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/ListNewNodesCopyIdsWorklet.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/NewHypernodePredicate.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/NewNodePredicate.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/PermuteComparator.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/SuperNodeWhenComparator.h>
|
||||
#include <vtkm/worklet/contourtree_distributed/tree_grafter/SuperarcWasNotTransferredPredicate.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/HierarchicalContourTree.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/InteriorForest.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/CalculateAttachementCounterWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/CollapseRegularChainsWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/CopyFirstHypernodePerIterationWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/CopyFirstSupernodePerIterationWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/CopyNewHypernodesWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/CopyNewNodesSetSuperparentsWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/CopyNewSupernodesSetSuperchildrenWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/CopyNewSupernodesWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/FindCriticalPointsFindLeafsWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/FindCriticalPointsFindSaddlesWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/FindCriticalPointsFindTerminalElementsWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/FindCriticalPointsSetUpDownNeighboursWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/GetHierarchicalIdsWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/GraftInteriorForestsSetTransferIterationWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/HyperNodeWhenComparator.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/IdentifyLeafHyperarcsWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/InitActiceSuperarcIdWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/InitActiceSuperarcsWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/ListNewNodesCopyIdsWorklet.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/NewHypernodePredicate.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/NewNodePredicate.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/PermuteComparator.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/SuperNodeWhenComparator.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_distributed/tree_grafter/SuperarcWasNotTransferredPredicate.h>
|
||||
|
||||
#include <sstream>
|
||||
#include <string>
|
@ -56,8 +56,6 @@
|
||||
#include <iostream> // std::cout
|
||||
#include <sstream> // std::stringstrea
|
||||
#include <string> // std::string
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/PrintVectors.h>
|
||||
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/Types.h>
|
||||
|
||||
|
||||
namespace vtkm
|
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in New Issue
Block a user