VTK-m  2.0
HyperSweepBlock.h
Go to the documentation of this file.
1 //============================================================================
2 // Copyright (c) Kitware, Inc.
3 // All rights reserved.
4 // See LICENSE.txt for details.
5 //
6 // This software is distributed WITHOUT ANY WARRANTY; without even
7 // the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
8 // PURPOSE. See the above copyright notice for more information.
9 //============================================================================
10 // Copyright (c) 2018, The Regents of the University of California, through
11 // Lawrence Berkeley National Laboratory (subject to receipt of any required approvals
12 // from the U.S. Dept. of Energy). All rights reserved.
13 //
14 // Redistribution and use in source and binary forms, with or without modification,
15 // are permitted provided that the following conditions are met:
16 //
17 // (1) Redistributions of source code must retain the above copyright notice, this
18 // list of conditions and the following disclaimer.
19 //
20 // (2) Redistributions in binary form must reproduce the above copyright notice,
21 // this list of conditions and the following disclaimer in the documentation
22 // and/or other materials provided with the distribution.
23 //
24 // (3) Neither the name of the University of California, Lawrence Berkeley National
25 // Laboratory, U.S. Dept. of Energy nor the names of its contributors may be
26 // used to endorse or promote products derived from this software without
27 // specific prior written permission.
28 //
29 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
30 // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
31 // WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
32 // IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
33 // INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
34 // BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
35 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
36 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
37 // OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
38 // OF THE POSSIBILITY OF SUCH DAMAGE.
39 //
40 //=============================================================================
41 //
42 // This code is an extension of the algorithm presented in the paper:
43 // Parallel Peak Pruning for Scalable SMP Contour Tree Computation.
44 // Hamish Carr, Gunther Weber, Christopher Sewell, and James Ahrens.
45 // Proceedings of the IEEE Symposium on Large Data Analysis and Visualization
46 // (LDAV), October 2016, Baltimore, Maryland.
47 //
48 // The PPP2 algorithm and software were jointly developed by
49 // Hamish Carr (University of Leeds), Gunther H. Weber (LBNL), and
50 // Oliver Ruebel (LBNL)
51 //==============================================================================
52 
53 #ifndef vtk_m_worklet_contourtree_distributed_hypersweepblock_h
54 #define vtk_m_worklet_contourtree_distributed_hypersweepblock_h
55 
56 #include <vtkm/Types.h>
57 #include <vtkm/cont/ArrayHandle.h>
59 
60 namespace vtkm
61 {
62 namespace worklet
63 {
64 namespace contourtree_distributed
65 {
66 
67 template <typename ContourTreeDataFieldType>
69 {
71  const vtkm::Id localBlockNo,
72  const int globalBlockId,
73  const vtkm::Id3& origin,
74  const vtkm::Id3& size,
75  const vtkm::Id3& globalSize,
77  hierarchicalContourTree)
78  : LocalBlockNo(localBlockNo)
79  , GlobalBlockId(globalBlockId)
80  , Origin(origin)
81  , Size(size)
82  , GlobalSize(globalSize)
83  , HierarchicalContourTree(hierarchicalContourTree)
84  {
85  }
86 
87  // Mesh information
93 
94  // Hierarchical contour tree for this block
97 
98  // Computed values
101 
102  // Destroy function allowing DIY to own blocks and clean them up after use
103  static void Destroy(void* b)
104  {
105  delete static_cast<HyperSweepBlock<ContourTreeDataFieldType>*>(b);
106  }
107 };
108 
109 } // namespace contourtree_distributed
110 } // namespace worklet
111 } // namespace vtkm
112 
113 #endif
vtkm::worklet::contourtree_distributed::HierarchicalContourTree< ContourTreeDataFieldType >
vtkm::cont::ArrayHandle< vtkm::Id >
ArrayHandle.h
vtkm
Groups connected points that have the same field value.
Definition: Atomic.h:19
HierarchicalContourTree.h
Types.h
vtkm::worklet::contourtree_distributed::HyperSweepBlock::LocalBlockNo
vtkm::Id LocalBlockNo
Definition: HyperSweepBlock.h:88
vtkm::worklet::contourtree_distributed::HyperSweepBlock::Origin
vtkm::Id3 Origin
Definition: HyperSweepBlock.h:90
vtkm::Id
vtkm::Int32 Id
Represents an ID (index into arrays).
Definition: Types.h:191
vtkm::worklet::contourtree_distributed::HyperSweepBlock::GlobalSize
vtkm::Id3 GlobalSize
Definition: HyperSweepBlock.h:92
vtkm::worklet::contourtree_distributed::HyperSweepBlock::HierarchicalContourTree
const vtkm::worklet::contourtree_distributed::HierarchicalContourTree< ContourTreeDataFieldType > & HierarchicalContourTree
Definition: HyperSweepBlock.h:96
vtkm::worklet::contourtree_distributed::HyperSweepBlock::DependentVolume
vtkm::cont::ArrayHandle< vtkm::Id > DependentVolume
Definition: HyperSweepBlock.h:100
vtkm::worklet::contourtree_distributed::HyperSweepBlock::IntrinsicVolume
vtkm::cont::ArrayHandle< vtkm::Id > IntrinsicVolume
Definition: HyperSweepBlock.h:99
vtkm::Vec< vtkm::Id, 3 >
vtkm::worklet::contourtree_distributed::HyperSweepBlock::GlobalBlockId
int GlobalBlockId
Definition: HyperSweepBlock.h:89
vtkm::worklet::contourtree_distributed::HyperSweepBlock::HyperSweepBlock
HyperSweepBlock(const vtkm::Id localBlockNo, const int globalBlockId, const vtkm::Id3 &origin, const vtkm::Id3 &size, const vtkm::Id3 &globalSize, const vtkm::worklet::contourtree_distributed::HierarchicalContourTree< ContourTreeDataFieldType > &hierarchicalContourTree)
Definition: HyperSweepBlock.h:70
vtkm::worklet::contourtree_distributed::HyperSweepBlock
Definition: HyperSweepBlock.h:68
vtkm::worklet::contourtree_distributed::HyperSweepBlock::Size
vtkm::Id3 Size
Definition: HyperSweepBlock.h:91
vtkm::worklet::contourtree_distributed::HyperSweepBlock::Destroy
static void Destroy(void *b)
Definition: HyperSweepBlock.h:103