2017-01-09 20:54:47 +00:00
|
|
|
//============================================================================
|
|
|
|
// 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 2014 Sandia Corporation.
|
|
|
|
// Copyright 2014 UT-Battelle, LLC.
|
|
|
|
// Copyright 2014 Los Alamos National Security.
|
|
|
|
//
|
|
|
|
// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
|
|
|
|
// the U.S. Government retains certain rights in this software.
|
|
|
|
//
|
|
|
|
// Under the terms of Contract DE-AC52-06NA25396 with Los Alamos National
|
|
|
|
// Laboratory (LANL), the U.S. Government retains certain rights in
|
|
|
|
// this software.
|
|
|
|
//============================================================================
|
2017-01-09 21:53:59 +00:00
|
|
|
// Copyright (c) 2016, Los Alamos National Security, LLC
|
|
|
|
// All rights reserved.
|
2017-01-09 20:54:47 +00:00
|
|
|
//
|
2017-01-09 21:53:59 +00:00
|
|
|
// Copyright 2016. Los Alamos National Security, LLC.
|
|
|
|
// This software was produced under U.S. Government contract DE-AC52-06NA25396
|
|
|
|
// for Los Alamos National Laboratory (LANL), which is operated by
|
|
|
|
// Los Alamos National Security, LLC for the U.S. Department of Energy.
|
|
|
|
// The U.S. Government has rights to use, reproduce, and distribute this
|
|
|
|
// software. NEITHER THE GOVERNMENT NOR LOS ALAMOS NATIONAL SECURITY, LLC
|
|
|
|
// MAKES ANY WARRANTY, EXPRESS OR IMPLIED, OR ASSUMES ANY LIABILITY FOR THE
|
|
|
|
// USE OF THIS SOFTWARE. If software is modified to produce derivative works,
|
|
|
|
// such modified software should be clearly marked, so as not to confuse it
|
|
|
|
// with the version available from LANL.
|
2017-01-09 20:54:47 +00:00
|
|
|
//
|
2017-01-09 21:53:59 +00:00
|
|
|
// Additionally, redistribution and use in source and binary forms, with or
|
|
|
|
// without modification, are permitted provided that the following conditions
|
|
|
|
// are met:
|
2017-01-09 20:54:47 +00:00
|
|
|
//
|
2017-01-09 21:53:59 +00:00
|
|
|
// 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 Los Alamos National Security, LLC, Los Alamos
|
|
|
|
// National Laboratory, LANL, the U.S. Government, nor the names of its
|
|
|
|
// contributors may be used to endorse or promote products derived from
|
|
|
|
// this software without specific prior written permission.
|
2017-01-09 20:54:47 +00:00
|
|
|
//
|
2017-01-09 21:53:59 +00:00
|
|
|
// THIS SOFTWARE IS PROVIDED BY LOS ALAMOS NATIONAL SECURITY, LLC 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 LOS ALAMOS
|
|
|
|
// NATIONAL SECURITY, LLC 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 based on 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.
|
|
|
|
|
2017-01-09 20:54:47 +00:00
|
|
|
//=======================================================================================
|
|
|
|
//
|
|
|
|
// COMMENTS:
|
|
|
|
//
|
|
|
|
// Basically, we have a single functor (so far), whose job is to work out the downwards
|
|
|
|
// join neighbour of each vertex.
|
|
|
|
//
|
|
|
|
// Any vector needed by the functor for lookup purposes will be passed as a parameter to
|
|
|
|
// the constructor and saved, with the actual function call being the operator ()
|
|
|
|
//
|
|
|
|
//=======================================================================================
|
|
|
|
|
|
|
|
#ifndef vtkm_worklet_contourtree_vertex_merge_comparator_h
|
|
|
|
#define vtkm_worklet_contourtree_vertex_merge_comparator_h
|
|
|
|
|
|
|
|
namespace vtkm {
|
|
|
|
namespace worklet {
|
|
|
|
namespace contourtree {
|
|
|
|
|
|
|
|
//=======================================================================================
|
|
|
|
//
|
|
|
|
// VertexMergeComparator
|
|
|
|
//
|
|
|
|
// A comparator that sorts the vertices on the join maximum (assuming already sorted on
|
|
|
|
// indexed value)
|
|
|
|
//
|
|
|
|
//=======================================================================================
|
|
|
|
|
|
|
|
template <typename T, typename StorageType, typename DeviceAdapter>
|
|
|
|
class VertexMergeComparator
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
typedef typename vtkm::cont::ArrayHandle<T,StorageType>::template ExecutionTypes<DeviceAdapter>::PortalConst ValuePortalType;
|
|
|
|
typedef typename vtkm::cont::ArrayHandle<vtkm::Id>::template ExecutionTypes<DeviceAdapter>::PortalConst IdPortalType;
|
|
|
|
|
|
|
|
ValuePortalType values;
|
|
|
|
IdPortalType extrema;
|
|
|
|
bool isJoinTree;
|
|
|
|
|
|
|
|
VTKM_CONT
|
|
|
|
VertexMergeComparator(ValuePortalType Values,
|
|
|
|
IdPortalType Extrema,
|
|
|
|
bool IsJoinTree)
|
|
|
|
: values(Values), extrema(Extrema), isJoinTree(IsJoinTree)
|
|
|
|
{}
|
|
|
|
|
|
|
|
VTKM_EXEC_CONT
|
|
|
|
bool operator() (const vtkm::Id& i, const vtkm::Id& j) const
|
|
|
|
{
|
|
|
|
// retrieve the pseudo-extremum the vertex belongs to
|
|
|
|
vtkm::Id pseudoExtI = extrema.Get(i);
|
|
|
|
vtkm::Id pseudoExtJ = extrema.Get(j);
|
|
|
|
|
|
|
|
if (pseudoExtI < pseudoExtJ)
|
|
|
|
return false ^ isJoinTree;
|
|
|
|
if (pseudoExtJ < pseudoExtI)
|
|
|
|
return true ^ isJoinTree;
|
|
|
|
|
|
|
|
T valueI = values.Get(i);
|
|
|
|
T valueJ = values.Get(j);
|
|
|
|
|
|
|
|
if (valueI < valueJ)
|
|
|
|
return false ^ isJoinTree;
|
|
|
|
if (valueI > valueJ)
|
|
|
|
return true ^ isJoinTree;
|
|
|
|
if (i < j)
|
|
|
|
return false ^ isJoinTree;
|
|
|
|
if (j < i)
|
|
|
|
return true ^ isJoinTree;
|
|
|
|
return false; // true ^ isJoinTree;
|
|
|
|
}
|
|
|
|
}; // VertexMergeComparator
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|