VTK-m  2.3
ExtractTopVolumeContoursBlock.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_filter_scalar_topology_internal_ExtractTopVolumeContoursBlock_h
54 #define vtk_m_filter_scalar_topology_internal_ExtractTopVolumeContoursBlock_h
55 
56 #include <vtkm/cont/DataSet.h>
57 #include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/Types.h>
58 #include <vtkm/filter/scalar_topology/worklet/select_top_volume_branches/TopVolumeBranchData.h>
59 
60 namespace vtkm
61 {
62 namespace filter
63 {
64 namespace scalar_topology
65 {
66 namespace internal
67 {
68 
69 struct ExtractTopVolumeContoursBlock
70 {
71  ExtractTopVolumeContoursBlock(vtkm::Id localBlockNo, int globalBlockId);
72 
73  // Block metadata
74  vtkm::Id LocalBlockNo;
75  int GlobalBlockId;
76 
77  // The data class for branch arrays (e.g., branch root global regular IDs, branch volume, etc.)
78  // we reuse the class TopVolumeBranchData that was used in SelectTopVolumeBranchesFilter,
79  // because we need more than half of the arrays in this class for contour extraction
80  TopVolumeBranchData TopVolumeData;
81 
82  // Isosurface output
83  vtkm::cont::ArrayHandle<vtkm::Vec3f_64> IsosurfaceEdgesFrom;
85  vtkm::worklet::contourtree_augmented::IdArrayType IsosurfaceEdgesOffset;
86  vtkm::worklet::contourtree_augmented::IdArrayType IsosurfaceEdgesLabels;
87  vtkm::worklet::contourtree_augmented::IdArrayType IsosurfaceEdgesOrders;
88  vtkm::cont::UnknownArrayHandle IsosurfaceIsoValue;
89  // this is a tricky one - it is a part of the isovalue but solely used for simulation of simplicity
90  vtkm::worklet::contourtree_augmented::IdArrayType IsosurfaceGRIds;
91 
92  // Destroy function allowing DIY to own blocks and clean them up after use
93  static void Destroy(void* b) { delete static_cast<ExtractTopVolumeContoursBlock*>(b); }
94 
95  // extract isosurfaces on top branches by volume
96  void ExtractIsosurfaceOnSelectedBranch(const vtkm::cont::DataSet& bdDataSet,
97  const bool isMarchingCubes,
98  const bool shiftIsovalueByEpsilon,
99  const vtkm::cont::LogLevel timingsLogLevel);
100 };
101 
102 } // namespace internal
103 } // namespace scalar_topology
104 } // namespace filter
105 } // namespace vtkm
106 #endif
vtkm::cont::ArrayHandle
Manages an array-worth of data.
Definition: ArrayHandle.h:300
vtkm
Groups connected points that have the same field value.
Definition: Atomic.h:19
vtkm::cont::LogLevel
LogLevel
Log levels for use with the logging macros.
Definition: Logging.h:298
vtkm::cont::UnknownArrayHandle
An ArrayHandle of an unknown value type and storage.
Definition: UnknownArrayHandle.h:430
vtkm::cont::DataSet
Contains and manages the geometric data structures that VTK-m operates on.
Definition: DataSet.h:57
vtkm::Id
vtkm::Int64 Id
Base type to use to index arrays.
Definition: Types.h:227
DataSet.h