4bf8bfb1fa
The implementation of the search in the k-d tree is problematic because it uses unbounded recursion. This is a problem for GPU devices, which have very short stacks set by how many calls the compiler determines. This is fixable, but the fix is not trivial. This class is not used anywhere in VTK-m other than a trivial test. Thus, I am just deprecating the class. I am also deleting the test, so the code is not run anymore.
18 lines
629 B
CMake
18 lines
629 B
CMake
##============================================================================
|
|
## 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.
|
|
##============================================================================
|
|
|
|
set(headers
|
|
BoundingIntervalHierarchy.h
|
|
KdTree3DConstruction.h # Deprecated
|
|
KdTree3DNNSearch.h # Deprecated
|
|
)
|
|
|
|
vtkm_declare_headers(${headers})
|