#include "parUtils.h"
#include "TreeNode.h"
#include <cassert>
#include "nodeAndValues.h"
#include "binUtils.h"
#include "dendro.h"
Go to the source code of this file.
Namespaces | |
namespace | ot |
Functions | |
int | appendCompleteRegion (TreeNode first, TreeNode second, std::vector< ot::TreeNode > &newNodes, bool includeMin, bool includeMax) |
The region between min(first,second) and max(first,second) is appended to the output vector. Both ends could be inclusive, dependng on the options. The new elements are sorted, unique and linear. | |
int | completeOctree (const std::vector< TreeNode > &inp, std::vector< TreeNode > &out, unsigned int dim, unsigned int maxDepth, bool isUnique, bool isSorted, bool assertNoEmptyProcs, MPI_Comm comm) |
Constructs the complete, linear, sorted octree containing the octants in inp. | |
int | completeSubtree (TreeNode block, const std::vector< TreeNode > &inp, std::vector< TreeNode > &out, unsigned int dim, unsigned int maxDepth, bool isUnique, bool isSorted) |
Constructs the complete, linear, sorted subtree of the block containing the octants in inp. | |
int | p2oLocal (std::vector< TreeNode > &nodes, std::vector< TreeNode > &leaves, unsigned int maxNumPts, unsigned int dim, unsigned int maxDepth) |
Sequential top-down loop inside points2Octree. | |
int | points2Octree (std::vector< double > &pts, double *gLens, std::vector< TreeNode > &nodes, unsigned int dim, unsigned int maxDepth, unsigned int maxNumPts, MPI_Comm comm) |
A function to construct a complete, sorted, linear octree from a set of points. | |
int | points2OctreeSeq (std::vector< double > &pts, double *gLens, std::vector< TreeNode > &nodes, unsigned int dim, unsigned int maxDepth, unsigned int maxNumPts) |
Sequential version of points2Octree. | |
int | regularGrid2Octree (const std::vector< double > &elementValues, unsigned int N, unsigned int nx, unsigned int ny, unsigned int nz, unsigned int xs, unsigned int ys, unsigned int zs, std::vector< TreeNode > &linOct, unsigned int dim, unsigned int maxDepth, double thresholdFac, MPI_Comm comm) |
A function to construct a complete, sorted, linear octree from a regular grid by coarsening the regular grid elements based on some threshold. |
Rahul S. Sampath, rahul.sampath@gmail.com
Definition in file Construct.C.
|
The region between min(first,second) and max(first,second) is appended to the output vector. Both ends could be inclusive, dependng on the options. The new elements are sorted, unique and linear.
Definition at line 1032 of file Construct.C. References ot::TreeNode::addChildren(), ot::areComparable(), ot::TreeNode::getDim(), ot::TreeNode::getMaxDepth(), ot::getNCA(), ot::TreeNode::getParent(), PROF_COMPLETE_REGION_BEGIN, and PROF_COMPLETE_REGION_END. Referenced by ot::blockPartStage1(), ot::blockPartStage1_p2o(), ot::completeOctree(), and ot::completeSubtree(). |
|
Constructs the complete, linear, sorted octree containing the octants in inp.
Definition at line 518 of file Construct.C. References ot::TreeNode::addChildren(), ot::appendCompleteRegion(), ot::areComparable(), ot::completeSubtree(), ot::getNCA(), ot::TreeNode::isAncestor(), PROF_N2O_BEGIN, PROF_N2O_END, and par::splitComm2way(). Referenced by ot::blockPartStage1(), ot::blockPartStage1_p2o(), main(), ot::simpleCoarsen(), and solve_neumann_oct(). |
|
Constructs the complete, linear, sorted subtree of the block containing the octants in inp.
Definition at line 667 of file Construct.C. References ot::TreeNode::addChildren(), ot::appendCompleteRegion(), ot::areComparable(), ot::TreeNode::getDFD(), ot::TreeNode::getDLD(), ot::getNCA(), PROF_N2O_SEQ_BEGIN, PROF_N2O_SEQ_END, and sort(). Referenced by ot::completeOctree(), main(), and ot::writePartitionVTK(). |
|
Sequential top-down loop inside points2Octree.
Definition at line 915 of file Construct.C. References ot::TreeNode::addChildren(), ot::TreeNode::addWeight(), ot::areComparable(), PROF_P2O_LOCAL_BEGIN, PROF_P2O_LOCAL_END, and ot::TreeNode::setWeight(). Referenced by ot::points2Octree(), and ot::points2OctreeSeq(). |
|
A function to construct a complete, sorted, linear octree from a set of points.
Definition at line 730 of file Construct.C. References ot::blockPartStage1_p2o(), ot::blockPartStage2_p2o(), DendroIntL, ot::p2oLocal(), ot::points2OctreeSeq(), PROF_P2O_BEGIN, PROF_P2O_END, and par::splitCommUsingSplittingRank(). Referenced by main(), and solve_neumann(). |
|
Sequential version of points2Octree.
Definition at line 860 of file Construct.C. References ot::p2oLocal(), PROF_P2O_SEQ_BEGIN, PROF_P2O_SEQ_END, and sort(). Referenced by ot::points2Octree(). |
|
A function to construct a complete, sorted, linear octree from a regular grid by coarsening the regular grid elements based on some threshold.
Definition at line 24 of file Construct.C. References DendroIntL, binOp::fastLog2(), ot::TreeNode::getChildNumber(), ot::TreeNode::getParent(), binOp::isPowerOfTwo(), ot::NodeAndValues< T, ARR_LEN >::node, PROF_RG2O_BEGIN, PROF_RG2O_END, par::splitCommUsingSplittingRank(), and ot::NodeAndValues< T, ARR_LEN >::values. |