| 
    VTK-m
    2.0
    
   | 
 
#include <vtkm/cont/Algorithm.h>#include <vtkm/cont/ArrayCopy.h>#include <vtkm/cont/ArrayHandle.h>#include <vtkm/cont/ArrayHandleIndex.h>#include <vtkm/cont/ArrayHandlePermutation.h>#include <vtkm/cont/Invoker.h>#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/NotNoSuchElementPredicate.h>#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/PrintVectors.h>#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/Types.h>#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/data_set_mesh/GetOwnedVerticesByGlobalIdWorklet.h>#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/data_set_mesh/IdRelabeler.h>#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/data_set_mesh/SimulatedSimplicityComperator.h>#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/data_set_mesh/SortIndices.h>#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/meshtypes/DataSetMeshTriangulation2DFreudenthal.h>#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/meshtypes/DataSetMeshTriangulation3DFreudenthal.h>#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/meshtypes/DataSetMeshTriangulation3DMarchingCubes.h>Go to the source code of this file.
Classes | |
| class | vtkm::worklet::contourtree_augmented::DataSetMesh | 
Namespaces | |
| vtkm | |
| Groups connected points that have the same field value.  | |
| vtkm::worklet | |
| VTK-m Worklets.  | |
| vtkm::worklet::contourtree_augmented | |
 1.8.17