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 ```
268 lines
8.9 KiB
C++
268 lines
8.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.
|
|
//============================================================================
|
|
#ifndef vtk_m_cont_CellLocatorBoundingIntervalHierarchyExec_h
|
|
#define vtk_m_cont_CellLocatorBoundingIntervalHierarchyExec_h
|
|
|
|
#include <vtkm/TopologyElementTag.h>
|
|
#include <vtkm/VecFromPortalPermute.h>
|
|
#include <vtkm/cont/ArrayHandle.h>
|
|
#include <vtkm/cont/ArrayHandleVirtualCoordinates.h>
|
|
#include <vtkm/exec/CellInside.h>
|
|
#include <vtkm/exec/CellLocator.h>
|
|
#include <vtkm/exec/ParametricCoordinates.h>
|
|
|
|
namespace vtkm
|
|
{
|
|
namespace exec
|
|
{
|
|
|
|
struct CellLocatorBoundingIntervalHierarchyNode
|
|
{
|
|
vtkm::IdComponent Dimension;
|
|
vtkm::Id ParentIndex;
|
|
vtkm::Id ChildIndex;
|
|
union {
|
|
struct
|
|
{
|
|
vtkm::FloatDefault LMax;
|
|
vtkm::FloatDefault RMin;
|
|
} Node;
|
|
struct
|
|
{
|
|
vtkm::Id Start;
|
|
vtkm::Id Size;
|
|
} Leaf;
|
|
};
|
|
|
|
VTKM_EXEC_CONT
|
|
CellLocatorBoundingIntervalHierarchyNode()
|
|
: Dimension()
|
|
, ParentIndex()
|
|
, ChildIndex()
|
|
, Node{ 0, 0 }
|
|
{
|
|
}
|
|
}; // struct CellLocatorBoundingIntervalHierarchyNode
|
|
|
|
template <typename DeviceAdapter, typename CellSetType>
|
|
class VTKM_ALWAYS_EXPORT CellLocatorBoundingIntervalHierarchyExec final
|
|
: public vtkm::exec::CellLocator
|
|
{
|
|
using NodeArrayHandle =
|
|
vtkm::cont::ArrayHandle<vtkm::exec::CellLocatorBoundingIntervalHierarchyNode>;
|
|
using CellIdArrayHandle = vtkm::cont::ArrayHandle<vtkm::Id>;
|
|
|
|
public:
|
|
VTKM_CONT
|
|
CellLocatorBoundingIntervalHierarchyExec() {}
|
|
|
|
VTKM_CONT
|
|
CellLocatorBoundingIntervalHierarchyExec(const NodeArrayHandle& nodes,
|
|
const CellIdArrayHandle& cellIds,
|
|
const CellSetType& cellSet,
|
|
const vtkm::cont::ArrayHandleVirtualCoordinates& coords,
|
|
DeviceAdapter)
|
|
: Nodes(nodes.PrepareForInput(DeviceAdapter()))
|
|
, CellIds(cellIds.PrepareForInput(DeviceAdapter()))
|
|
, CellSet(cellSet.PrepareForInput(DeviceAdapter(), VisitType(), IncidentType()))
|
|
, Coords(coords.PrepareForInput(DeviceAdapter()))
|
|
{
|
|
}
|
|
|
|
|
|
VTKM_EXEC_CONT virtual ~CellLocatorBoundingIntervalHierarchyExec() noexcept
|
|
{
|
|
// This must not be defaulted, since defaulted virtual destructors are
|
|
// troublesome with CUDA __host__ __device__ markup.
|
|
}
|
|
|
|
VTKM_EXEC
|
|
void FindCell(const vtkm::Vec3f& point,
|
|
vtkm::Id& cellId,
|
|
vtkm::Vec3f& parametric,
|
|
const vtkm::exec::FunctorBase& worklet) const override
|
|
{
|
|
cellId = -1;
|
|
vtkm::Id nodeIndex = 0;
|
|
FindCellState state = FindCellState::EnterNode;
|
|
|
|
while ((cellId < 0) && !((nodeIndex == 0) && (state == FindCellState::AscendFromNode)))
|
|
{
|
|
switch (state)
|
|
{
|
|
case FindCellState::EnterNode:
|
|
this->EnterNode(state, point, cellId, nodeIndex, parametric, worklet);
|
|
break;
|
|
case FindCellState::AscendFromNode:
|
|
this->AscendFromNode(state, nodeIndex);
|
|
break;
|
|
case FindCellState::DescendLeftChild:
|
|
this->DescendLeftChild(state, point, nodeIndex);
|
|
break;
|
|
case FindCellState::DescendRightChild:
|
|
this->DescendRightChild(state, point, nodeIndex);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
private:
|
|
enum struct FindCellState
|
|
{
|
|
EnterNode,
|
|
AscendFromNode,
|
|
DescendLeftChild,
|
|
DescendRightChild
|
|
};
|
|
|
|
VTKM_EXEC
|
|
void EnterNode(FindCellState& state,
|
|
const vtkm::Vec3f& point,
|
|
vtkm::Id& cellId,
|
|
vtkm::Id nodeIndex,
|
|
vtkm::Vec3f& parametric,
|
|
const vtkm::exec::FunctorBase& worklet) const
|
|
{
|
|
VTKM_ASSERT(state == FindCellState::EnterNode);
|
|
|
|
const vtkm::exec::CellLocatorBoundingIntervalHierarchyNode& node = this->Nodes.Get(nodeIndex);
|
|
|
|
if (node.ChildIndex < 0)
|
|
{
|
|
// In a leaf node. Look for a containing cell.
|
|
cellId = this->FindInLeaf(point, parametric, node, worklet);
|
|
state = FindCellState::AscendFromNode;
|
|
}
|
|
else
|
|
{
|
|
state = FindCellState::DescendLeftChild;
|
|
}
|
|
}
|
|
|
|
VTKM_EXEC
|
|
void AscendFromNode(FindCellState& state, vtkm::Id& nodeIndex) const
|
|
{
|
|
VTKM_ASSERT(state == FindCellState::AscendFromNode);
|
|
|
|
vtkm::Id childNodeIndex = nodeIndex;
|
|
const vtkm::exec::CellLocatorBoundingIntervalHierarchyNode& childNode =
|
|
this->Nodes.Get(childNodeIndex);
|
|
nodeIndex = childNode.ParentIndex;
|
|
const vtkm::exec::CellLocatorBoundingIntervalHierarchyNode& parentNode =
|
|
this->Nodes.Get(nodeIndex);
|
|
|
|
if (parentNode.ChildIndex == childNodeIndex)
|
|
{
|
|
// Ascending from left child. Descend into the right child.
|
|
state = FindCellState::DescendRightChild;
|
|
}
|
|
else
|
|
{
|
|
VTKM_ASSERT(parentNode.ChildIndex + 1 == childNodeIndex);
|
|
// Ascending from right child. Ascend again. (Don't need to change state.)
|
|
}
|
|
}
|
|
|
|
VTKM_EXEC
|
|
void DescendLeftChild(FindCellState& state, const vtkm::Vec3f& point, vtkm::Id& nodeIndex) const
|
|
{
|
|
VTKM_ASSERT(state == FindCellState::DescendLeftChild);
|
|
|
|
const vtkm::exec::CellLocatorBoundingIntervalHierarchyNode& node = this->Nodes.Get(nodeIndex);
|
|
const vtkm::FloatDefault& coordinate = point[node.Dimension];
|
|
if (coordinate <= node.Node.LMax)
|
|
{
|
|
// Left child does contain the point. Do the actual descent.
|
|
nodeIndex = node.ChildIndex;
|
|
state = FindCellState::EnterNode;
|
|
}
|
|
else
|
|
{
|
|
// Left child does not contain the point. Skip to the right child.
|
|
state = FindCellState::DescendRightChild;
|
|
}
|
|
}
|
|
|
|
VTKM_EXEC
|
|
void DescendRightChild(FindCellState& state, const vtkm::Vec3f& point, vtkm::Id& nodeIndex) const
|
|
{
|
|
VTKM_ASSERT(state == FindCellState::DescendRightChild);
|
|
|
|
const vtkm::exec::CellLocatorBoundingIntervalHierarchyNode& node = this->Nodes.Get(nodeIndex);
|
|
const vtkm::FloatDefault& coordinate = point[node.Dimension];
|
|
if (coordinate >= node.Node.RMin)
|
|
{
|
|
// Right child does contain the point. Do the actual descent.
|
|
nodeIndex = node.ChildIndex + 1;
|
|
state = FindCellState::EnterNode;
|
|
}
|
|
else
|
|
{
|
|
// Right child does not contain the point. Skip to ascent
|
|
state = FindCellState::AscendFromNode;
|
|
}
|
|
}
|
|
|
|
VTKM_EXEC vtkm::Id FindInLeaf(const vtkm::Vec3f& point,
|
|
vtkm::Vec3f& parametric,
|
|
const vtkm::exec::CellLocatorBoundingIntervalHierarchyNode& node,
|
|
const vtkm::exec::FunctorBase& worklet) const
|
|
{
|
|
using IndicesType = typename CellSetPortal::IndicesType;
|
|
for (vtkm::Id i = node.Leaf.Start; i < node.Leaf.Start + node.Leaf.Size; ++i)
|
|
{
|
|
vtkm::Id cellId = this->CellIds.Get(i);
|
|
IndicesType cellPointIndices = this->CellSet.GetIndices(cellId);
|
|
vtkm::VecFromPortalPermute<IndicesType, CoordsPortal> cellPoints(&cellPointIndices,
|
|
this->Coords);
|
|
if (IsPointInCell(point, parametric, this->CellSet.GetCellShape(cellId), cellPoints, worklet))
|
|
{
|
|
return cellId;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
template <typename CoordsType, typename CellShapeTag>
|
|
VTKM_EXEC static bool IsPointInCell(const vtkm::Vec3f& point,
|
|
vtkm::Vec3f& parametric,
|
|
CellShapeTag cellShape,
|
|
const CoordsType& cellPoints,
|
|
const vtkm::exec::FunctorBase& worklet)
|
|
{
|
|
bool success = false;
|
|
parametric = vtkm::exec::WorldCoordinatesToParametricCoordinates(
|
|
cellPoints, point, cellShape, success, worklet);
|
|
return success && vtkm::exec::CellInside(parametric, cellShape);
|
|
}
|
|
|
|
using VisitType = vtkm::TopologyElementTagCell;
|
|
using IncidentType = vtkm::TopologyElementTagPoint;
|
|
using NodePortal = typename NodeArrayHandle::template ExecutionTypes<DeviceAdapter>::PortalConst;
|
|
using CellIdPortal =
|
|
typename CellIdArrayHandle::template ExecutionTypes<DeviceAdapter>::PortalConst;
|
|
using CellSetPortal = typename CellSetType::template ExecutionTypes<DeviceAdapter,
|
|
VisitType,
|
|
IncidentType>::ExecObjectType;
|
|
using CoordsPortal = typename vtkm::cont::ArrayHandleVirtualCoordinates::template ExecutionTypes<
|
|
DeviceAdapter>::PortalConst;
|
|
|
|
NodePortal Nodes;
|
|
CellIdPortal CellIds;
|
|
CellSetPortal CellSet;
|
|
CoordsPortal Coords;
|
|
}; // class CellLocatorBoundingIntervalHierarchyExec
|
|
|
|
} // namespace exec
|
|
|
|
} // namespace vtkm
|
|
|
|
#endif //vtk_m_cont_CellLocatorBoundingIntervalHierarchyExec_h
|