Dendro  5.01
Dendro in Greek language means tree. The Dendro library is a large scale (262K cores on ORNL's Titan) distributed memory adaptive octree framework. The main goal of Dendro is to perform large scale multiphysics simulations efficeiently in mordern supercomputers. Dendro consists of efficient parallel data structures and algorithms to perform variational ( finite element) methods and finite difference mthods on 2:1 balanced arbitary adaptive octrees which enables the users to perform simulations raning from black holes (binary black hole mergers) to blood flow in human body, where applications ranging from relativity, astrophysics to biomedical engineering.
testOctUtils.h
1 //
2 // Created by milinda on 6/12/16.
3 //
4 /*
5  * @author: Milinda Shayamal Fernando
6  * School of Computing, University of Utah
7  * @date: 6/12/2016
8  *
9  * This file contains code to test octree related utilities, like octree construction, balancing, implementations based on the treeSort aproach.
10  *
11  * */
12 
13 #ifndef SFCSORTBENCH_TESTOCTUTILS_H
14 #define SFCSORTBENCH_TESTOCTUTILS_H
15 
16 #include <iostream>
17 #include "treenode2vtk.h"
18 #include "genPts_par.h"
19 #include "TreeNode.h"
20 #include "mpi.h"
21 #include "dendro.h"
22 #include "sfcSort.h"
23 #include "treenode2vtk.h"
24 #include "testUtils.h"
25 
26 #define ROOT_PROC 0
27 
28 
29 
30 int readPtsFromFile(char* filename, std::vector<double>& pts);
31 
32 
33 
34 
35 #endif //SFCSORTBENCH_TESTOCTUTILS_H
testUtils.h
A Set of utilities to test octrees.
Generated by   doxygen 1.8.13