File: TestSimpleIncrementalOctreePointLocator.cxx

package info (click to toggle)
paraview 5.11.0%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 497,236 kB
  • sloc: cpp: 3,171,290; ansic: 1,315,072; python: 134,290; xml: 103,324; sql: 65,887; sh: 5,286; javascript: 4,901; yacc: 4,383; java: 3,977; perl: 2,363; lex: 1,909; f90: 1,255; objc: 143; makefile: 119; tcl: 59; pascal: 50; fortran: 29
file content (71 lines) | stat: -rw-r--r-- 2,295 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include "vtkIncrementalOctreeNode.h"
#include "vtkIncrementalOctreePointLocator.h"
#include "vtkNew.h"
#include "vtkPoints.h"

#include <array>

int TestSimpleIncrementalOctreePointLocator(int, char** const)
{
  std::array<double, 6> bb = { 0, 1, 0, 1, 0, 1 };
  std::array<std::array<double, 3>, 18> pointsInput;
  for (size_t i = 0; i < pointsInput.size(); ++i)
  {
    for (size_t j = 0; j < pointsInput[i].size(); ++j)
      pointsInput[i][j] = (static_cast<double>(i + 1)) / (pointsInput.size() + 1);
  }
  vtkNew<vtkPoints> points;
  points->SetDataTypeToDouble();
  vtkNew<vtkIncrementalOctreePointLocator> octree;
  // that is the minimum
  octree->SetMaxPointsPerLeaf(16);
  octree->InitPointInsertion(points, bb.data());
  for (auto point : pointsInput)
  {
    octree->InsertNextPoint(point.data());
  }
  // we expect the same number points
  if (static_cast<size_t>(points->GetNumberOfPoints()) != pointsInput.size())
  {
    std::cerr << "Wrong number of points: " << points->GetNumberOfPoints()
              << " expected: " << pointsInput.size() << std::endl;
    return EXIT_FAILURE;
  }
  // 2 levels
  int numberOfLevels = octree->GetNumberOfLevels();
  if (numberOfLevels != 2)
  {
    std::cerr << "Got number of levels: " << numberOfLevels << " expected: " << 2 << std::endl;
    return EXIT_FAILURE;
  }
  int numberOfNodes = octree->GetNumberOfNodes();
  if (numberOfNodes != 9)
  {
    std::cerr << "Got number of nodes: " << numberOfNodes << " expected: " << 9 << std::endl;
  }
  vtkIncrementalOctreeNode* root = octree->GetRoot();
  if (root->GetID() != 0)
  {
    std::cerr << "Expected node ID 0 but got: " << root->GetID() << std::endl;
    return EXIT_FAILURE;
  }
  for (int i = 0; i < 8; ++i)
  {
    vtkIncrementalOctreeNode* node = root->GetChild(i);
    if (node->GetID() != i + 1)
    {
      std::cerr << "Expected node ID " << (i + 1) << " but got: " << node->GetID() << std::endl;
      return EXIT_FAILURE;
    }
  }
  vtkIdType id = octree->FindClosestPoint(0, 0, 0);
  if (id != 0)
  {
    std::cerr << "Point closes to 0 should be at index 0 but it is at: " << id << std::endl;
    return EXIT_FAILURE;
  }
  double* p = points->GetPoint(id);
  std::cout << "Point: " << p[0] << ", " << p[1] << ", " << p[2] << std::endl;

  return EXIT_SUCCESS;
}