SelectTopVolumeBranchesBlock.h

Go to the documentation of this file.

//============================================================================
//  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_internal_SelectTopVolumeBranchesBlock_h
#define vtk_m_filter_scalar_topology_internal_SelectTopVolumeBranchesBlock_h
 
#include <vtkm/cont/DataSet.h>
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/Types.h>
#include <vtkm/filter/scalar_topology/worklet/select_top_volume_branches/BranchDecompositionTreeMaker.h>
#include <vtkm/filter/scalar_topology/worklet/select_top_volume_branches/TopVolumeBranchData.h>
 
namespace vtkm
{
namespace filter
{
namespace scalar_topology
{
namespace internal
{
 
struct SelectTopVolumeBranchesBlock
{
  SelectTopVolumeBranchesBlock(vtkm::Id localBlockNo, int globalBlockId);
 
  // Block metadata
  vtkm::Id LocalBlockNo;
  int GlobalBlockId;
 
  // the data class for branch arrays (e.g., branch root global regular IDs, branch volume, etc.)
  TopVolumeBranchData TopVolumeData;
 
  // the factory class to compute the relation of top-volume branches
  BranchDecompositionTreeMaker BDTMaker;
 
  // Destroy function allowing DIY to own blocks and clean them up after use
  static void Destroy(void* b) { delete static_cast<SelectTopVolumeBranchesBlock*>(b); }
 
  // compute the volume of local branches, and sort them by volume
  void SortBranchByVolume(const vtkm::cont::DataSet& bdDataSet, const vtkm::Id totalVolume);
 
  // choose the top branches by volume
  void SelectLocalTopVolumeBranches(const vtkm::cont::DataSet& bdDataSet,
                                    const vtkm::Id nSavedBranches);
 
  // compute the branch decomposition tree (implicitly) for top branches
  void ComputeTopVolumeBranchHierarchy(const vtkm::cont::DataSet& bdDataSet);
 
  // exclude branches whose volume <= presimplifyThreshold
  vtkm::Id ExcludeTopVolumeBranchByThreshold(const vtkm::Id presimplifyThreshold);
};
 
} // namespace internal
} // namespace scalar_topology
} // namespace filter
} // namespace vtkm
#endif