mirror of
https://gitlab.kitware.com/vtk/vtk-m
synced 2024-09-20 02:55:47 +00:00
5db762ee71
The `From` and `To` nomenclature for topology mapping has been confusing for both users and developers, especially at lower levels where the intention of mapping attributes from one element to another is easily conflated with the concept of mapping indices (which maps in the exact opposite direction). These identifiers have been renamed to `VisitTopology` and `IncidentTopology` to clarify the direction of the mapping. The order in which these template parameters are specified for `WorkletMapTopology` have also been reversed, since eventually there may be more than one `IncidentTopology`, and having `IncidentTopology` at the end will allow us to replace it with a variadic template parameter pack in the future. Other implementation details supporting these worklets, include `Fetch` tags, `Connectivity` classes, and methods on the various `CellSet` classes (such as `PrepareForInput` have also reversed their template arguments. These will need to be cautiously updated. The convenience implementations of `WorkletMapTopology` have been renamed for clarity as follows: ``` WorkletMapPointToCell --> WorkletVisitCellsWithPoints WorkletMapCellToPoint --> WorkletVisitPointsWithCells ``` The `ControlSignature` tags have been renamed as follows: ``` FieldInTo --> FieldInVisit FieldInFrom --> FieldInMap FromCount --> IncidentElementCount FromIndices --> IncidentElementIndices ```
127 lines
4.9 KiB
C++
127 lines
4.9 KiB
C++
//============================================================================
|
|
// 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.
|
|
//============================================================================
|
|
|
|
#include <vtkm/cont/Algorithm.h>
|
|
#include <vtkm/cont/ArrayHandleConcatenate.h>
|
|
#include <vtkm/cont/CellLocatorBoundingIntervalHierarchy.h>
|
|
#include <vtkm/cont/DataSetBuilderUniform.h>
|
|
#include <vtkm/cont/Invoker.h>
|
|
#include <vtkm/cont/Timer.h>
|
|
#include <vtkm/cont/testing/Testing.h>
|
|
#include <vtkm/exec/CellInterpolate.h>
|
|
#include <vtkm/exec/ParametricCoordinates.h>
|
|
#include <vtkm/io/reader/VTKDataSetReader.h>
|
|
|
|
namespace
|
|
{
|
|
struct CellCentroidCalculator : public vtkm::worklet::WorkletVisitCellsWithPoints
|
|
{
|
|
typedef void ControlSignature(CellSetIn, FieldInPoint, FieldOut);
|
|
typedef _3 ExecutionSignature(_1, PointCount, _2);
|
|
|
|
template <typename CellShape, typename InputPointField>
|
|
VTKM_EXEC typename InputPointField::ComponentType operator()(
|
|
CellShape shape,
|
|
vtkm::IdComponent numPoints,
|
|
const InputPointField& inputPointField) const
|
|
{
|
|
vtkm::Vec3f parametricCenter = vtkm::exec::ParametricCoordinatesCenter(numPoints, shape, *this);
|
|
return vtkm::exec::CellInterpolate(inputPointField, parametricCenter, shape, *this);
|
|
}
|
|
}; // struct CellCentroidCalculator
|
|
|
|
struct BoundingIntervalHierarchyTester : public vtkm::worklet::WorkletMapField
|
|
{
|
|
typedef void ControlSignature(FieldIn, ExecObject, FieldIn, FieldOut);
|
|
typedef _4 ExecutionSignature(_1, _2, _3);
|
|
|
|
template <typename Point, typename BoundingIntervalHierarchyExecObject>
|
|
VTKM_EXEC vtkm::IdComponent operator()(const Point& point,
|
|
const BoundingIntervalHierarchyExecObject& bih,
|
|
const vtkm::Id expectedId) const
|
|
{
|
|
vtkm::Vec3f parametric;
|
|
vtkm::Id cellId;
|
|
bih->FindCell(point, cellId, parametric, *this);
|
|
return (1 - static_cast<vtkm::IdComponent>(expectedId == cellId));
|
|
}
|
|
}; // struct BoundingIntervalHierarchyTester
|
|
|
|
vtkm::cont::DataSet ConstructDataSet(vtkm::Id size)
|
|
{
|
|
return vtkm::cont::DataSetBuilderUniform().Create(vtkm::Id3(size, size, size));
|
|
}
|
|
|
|
void TestBoundingIntervalHierarchy(vtkm::cont::DataSet dataSet, vtkm::IdComponent numPlanes)
|
|
{
|
|
using Timer = vtkm::cont::Timer;
|
|
|
|
vtkm::cont::DynamicCellSet cellSet = dataSet.GetCellSet();
|
|
vtkm::cont::ArrayHandleVirtualCoordinates vertices = dataSet.GetCoordinateSystem().GetData();
|
|
|
|
std::cout << "Using numPlanes: " << numPlanes << "\n";
|
|
std::cout << "Building Bounding Interval Hierarchy Tree" << std::endl;
|
|
vtkm::cont::CellLocatorBoundingIntervalHierarchy bih =
|
|
vtkm::cont::CellLocatorBoundingIntervalHierarchy(numPlanes, 5);
|
|
bih.SetCellSet(cellSet);
|
|
bih.SetCoordinates(dataSet.GetCoordinateSystem());
|
|
bih.Update();
|
|
std::cout << "Built Bounding Interval Hierarchy Tree" << std::endl;
|
|
|
|
Timer centroidsTimer;
|
|
centroidsTimer.Start();
|
|
vtkm::cont::ArrayHandle<vtkm::Vec3f> centroids;
|
|
vtkm::worklet::DispatcherMapTopology<CellCentroidCalculator>().Invoke(
|
|
cellSet, vertices, centroids);
|
|
centroidsTimer.Stop();
|
|
std::cout << "Centroids calculation time: " << centroidsTimer.GetElapsedTime() << "\n";
|
|
|
|
vtkm::cont::ArrayHandleCounting<vtkm::Id> expectedCellIds(0, 1, cellSet.GetNumberOfCells());
|
|
|
|
Timer interpolationTimer;
|
|
interpolationTimer.Start();
|
|
vtkm::cont::ArrayHandle<vtkm::IdComponent> results;
|
|
|
|
vtkm::worklet::DispatcherMapField<BoundingIntervalHierarchyTester>().Invoke(
|
|
centroids, bih, expectedCellIds, results);
|
|
|
|
vtkm::Id numDiffs = vtkm::cont::Algorithm::Reduce(results, 0, vtkm::Add());
|
|
interpolationTimer.Stop();
|
|
vtkm::Float64 timeDiff = interpolationTimer.GetElapsedTime();
|
|
std::cout << "No of interpolations: " << results.GetNumberOfValues() << "\n";
|
|
std::cout << "Interpolation time: " << timeDiff << "\n";
|
|
std::cout << "Average interpolation rate: "
|
|
<< (static_cast<vtkm::Float64>(results.GetNumberOfValues()) / timeDiff) << "\n";
|
|
std::cout << "No of diffs: " << numDiffs << "\n";
|
|
VTKM_TEST_ASSERT(numDiffs == 0, "Calculated cell Ids not the same as expected cell Ids");
|
|
}
|
|
|
|
void RunTest()
|
|
{
|
|
//If this test is run on a machine that already has heavy
|
|
//cpu usage it will fail, so we limit the number of threads
|
|
//to avoid the test timing out
|
|
#ifdef VTKM_ENABLE_OPENMP
|
|
omp_set_num_threads(std::min(4, omp_get_max_threads()));
|
|
#endif
|
|
|
|
TestBoundingIntervalHierarchy(ConstructDataSet(16), 3);
|
|
TestBoundingIntervalHierarchy(ConstructDataSet(16), 4);
|
|
TestBoundingIntervalHierarchy(ConstructDataSet(16), 6);
|
|
TestBoundingIntervalHierarchy(ConstructDataSet(16), 9);
|
|
}
|
|
|
|
} // anonymous namespace
|
|
|
|
int UnitTestBoundingIntervalHierarchy(int argc, char* argv[])
|
|
{
|
|
return vtkm::cont::testing::Testing::Run(RunTest, argc, argv);
|
|
}
|