2018-08-08 18:38:06 +00:00
|
|
|
//============================================================================
|
|
|
|
// Copyright (c) Kitware, Inc.
|
|
|
|
// All rights reserved.
|
|
|
|
// See LICENSE.txt for details.
|
2019-04-15 23:24:21 +00:00
|
|
|
//
|
2018-08-08 18:38:06 +00:00
|
|
|
// 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)
|
|
|
|
//==============================================================================
|
|
|
|
|
2020-01-22 22:04:11 +00:00
|
|
|
#ifndef vtk_m_worklet_contourtree_augmented_contourtree_maker_inc_hypernodes_set_first_superchild_h
|
|
|
|
#define vtk_m_worklet_contourtree_augmented_contourtree_maker_inc_hypernodes_set_first_superchild_h
|
2018-08-08 18:38:06 +00:00
|
|
|
|
|
|
|
#include <vtkm/worklet/WorkletMapField.h>
|
2018-09-26 17:48:37 +00:00
|
|
|
#include <vtkm/worklet/contourtree_augmented/Types.h>
|
2018-08-08 18:38:06 +00:00
|
|
|
|
|
|
|
namespace vtkm
|
|
|
|
{
|
|
|
|
namespace worklet
|
|
|
|
{
|
2018-09-26 17:48:37 +00:00
|
|
|
namespace contourtree_augmented
|
2018-08-08 18:38:06 +00:00
|
|
|
{
|
|
|
|
namespace contourtree_maker_inc
|
|
|
|
{
|
|
|
|
|
|
|
|
// Worklet for loop through the hyperparents array, setting the first one for each
|
|
|
|
class ComputeHyperAndSuperStructure_HypernodesSetFirstSuperchild
|
|
|
|
: public vtkm::worklet::WorkletMapField
|
|
|
|
{
|
|
|
|
public:
|
2019-01-10 18:59:25 +00:00
|
|
|
typedef void ControlSignature(WholeArrayIn contourTreeHyperparents, // (input)
|
|
|
|
WholeArrayIn superSortIndex, // (input)
|
|
|
|
WholeArrayOut contourTreeHypernodes // (output)
|
2020-08-17 14:18:24 +00:00
|
|
|
);
|
2018-08-08 18:38:06 +00:00
|
|
|
typedef void ExecutionSignature(_1, InputIndex, _2, _3);
|
2018-10-03 13:19:29 +00:00
|
|
|
using InputDomain = _1;
|
2018-08-08 18:38:06 +00:00
|
|
|
|
|
|
|
// Default Constructor
|
|
|
|
VTKM_EXEC_CONT
|
|
|
|
ComputeHyperAndSuperStructure_HypernodesSetFirstSuperchild() {}
|
|
|
|
|
|
|
|
template <typename InFieldPortalType, typename OutFieldPortalType>
|
|
|
|
VTKM_EXEC void operator()(const InFieldPortalType& contourTreeHyperparentsPortal,
|
|
|
|
const vtkm::Id supernode,
|
|
|
|
const InFieldPortalType& superSortIndexPortal,
|
|
|
|
const OutFieldPortalType& contourTreeHypernodesPortal) const
|
|
|
|
{
|
|
|
|
bool isFirstSuperchild = false;
|
|
|
|
vtkm::Id hyperparent = contourTreeHyperparentsPortal.Get(supernode);
|
|
|
|
|
|
|
|
// first supernode is always a first superchild: otherwise, must have a different hyperparent
|
|
|
|
if (supernode == 0)
|
|
|
|
isFirstSuperchild = true;
|
|
|
|
else if (hyperparent != contourTreeHyperparentsPortal.Get(supernode - 1))
|
|
|
|
isFirstSuperchild = true;
|
|
|
|
|
|
|
|
// set the hyperparent's first superchild
|
|
|
|
if (isFirstSuperchild)
|
2020-01-23 07:15:28 +00:00
|
|
|
contourTreeHypernodesPortal.Set(superSortIndexPortal.Get(MaskedIndex(hyperparent)),
|
2018-08-08 18:38:06 +00:00
|
|
|
supernode);
|
|
|
|
|
|
|
|
// In serial this worklet implements the following operation
|
|
|
|
/*
|
2020-01-23 18:46:56 +00:00
|
|
|
for (vtkm::Id supernode = 0; supernode < contourTree.Supernodes.size(); supernode++)
|
2018-08-08 18:38:06 +00:00
|
|
|
{ // per supernode
|
|
|
|
bool isFirstSuperchild = false;
|
|
|
|
vtkm::Id hyperparent = contourTree.hyperparents[supernode];
|
|
|
|
|
|
|
|
// first supernode is always a first superchild: otherwise, must have a different hyperparent
|
|
|
|
if (supernode == 0)
|
|
|
|
isFirstSuperchild = true;
|
|
|
|
else if (hyperparent != contourTree.hyperparents[supernode-1])
|
|
|
|
isFirstSuperchild = true;
|
|
|
|
|
|
|
|
// set the hyperparent's first superchild
|
|
|
|
if (isFirstSuperchild)
|
2020-01-23 07:15:28 +00:00
|
|
|
contourTree.hypernodes[superSortIndex[MaskedIndex(hyperparent)]] = supernode;
|
2018-08-08 18:38:06 +00:00
|
|
|
} // per supernode
|
|
|
|
*/
|
|
|
|
}
|
|
|
|
|
|
|
|
}; // AugmentMergeTrees_InitNewJoinSplitIDAndSuperparents.h
|
|
|
|
|
|
|
|
} // namespace contourtree_maker_inc
|
2018-09-26 17:48:37 +00:00
|
|
|
} // namespace contourtree_augmented
|
2018-08-08 18:38:06 +00:00
|
|
|
} // namespace worklet
|
|
|
|
} // namespace vtkm
|
|
|
|
|
|
|
|
#endif
|