#include <KdTree.hpp>
Public Member Functions | |
| PREC | compute (const PREC &splitRatio, const PREC &pointRatio, const PREC &minMaxExtentRatio) |
| LinearQualityEvaluator (PREC ws=0.0, PREC wp=0.0, PREC we=1.0) | |
| void | setLevel (unsigned int level) |
Private Attributes | |
| PREC | m_weightMinMaxExtentRatio = 1.0 |
| PREC | m_weightPointRatio = 0.0 |
| PREC | m_weightSplitRatio = 0.0 |
Quality evaluator for the split heuristic s = split ratio is between (0,0.5] p = point ratio is between [0,0.5] e = extent ratio is between (0,1] ws,wp,we are weightings between [0,1] for the following linear criteria: J(s,p,e) = ws*2*s + wp*2*p + we*e which is the return value of compute() and maximized by the kd-Tree building procedure!
Definition at line 266 of file KdTree.hpp.
| ApproxMVBB::KdTree::LinearQualityEvaluator::LinearQualityEvaluator | ( | PREC | ws = 0.0, |
| PREC | wp = 0.0, |
||
| PREC | we = 1.0 |
||
| ) | [inline] |
By default ws=0, wp=0, we=1.0 which maximizes the extent ratio which is sensfull for midpoint splitting!
Definition at line 272 of file KdTree.hpp.
| PREC ApproxMVBB::KdTree::LinearQualityEvaluator::compute | ( | const PREC & | splitRatio, |
| const PREC & | pointRatio, | ||
| const PREC & | minMaxExtentRatio | ||
| ) | [inline] |
Definition at line 279 of file KdTree.hpp.
| void ApproxMVBB::KdTree::LinearQualityEvaluator::setLevel | ( | unsigned int | level | ) | [inline] |
Definition at line 275 of file KdTree.hpp.
PREC ApproxMVBB::KdTree::LinearQualityEvaluator::m_weightMinMaxExtentRatio = 1.0 [private] |
Definition at line 289 of file KdTree.hpp.
PREC ApproxMVBB::KdTree::LinearQualityEvaluator::m_weightPointRatio = 0.0 [private] |
Definition at line 288 of file KdTree.hpp.
PREC ApproxMVBB::KdTree::LinearQualityEvaluator::m_weightSplitRatio = 0.0 [private] |
Quality weights
Definition at line 287 of file KdTree.hpp.