hierarchy_tree.h

Go to the documentation of this file.

/*
 * Software License Agreement (BSD License)
 *
 *  Copyright (c) 2011-2014, Willow Garage, Inc.
 *  Copyright (c) 2014-2016, Open Source Robotics Foundation
 *  All rights reserved.
 *
 *  Redistribution and use in source and binary forms, with or without
 *  modification, are permitted provided that the following conditions
 *  are met:
 *
 *   * Redistributions of source code must retain the above copyright
 *     notice, this list of conditions and the following disclaimer.
 *   * Redistributions in binary form must reproduce the above
 *     copyright notice, this list of conditions and the following
 *     disclaimer in the documentation and/or other materials provided
 *     with the distribution.
 *   * Neither the name of Open Source Robotics Foundation nor the names of its
 *     contributors may be used to endorse or promote products derived
 *     from this software without specific prior written permission.
 *
 *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 *  "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 *  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
 *  FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
 *  COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
 *  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
 *  BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 *  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
 *  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 *  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
 *  ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 *  POSSIBILITY OF SUCH DAMAGE.
 */
 
#ifndef COAL_HIERARCHY_TREE_H
#define COAL_HIERARCHY_TREE_H
 
#include <vector>
#include <map>
#include <functional>
#include <iostream>
#include "coal/warning.hh"
#include "coal/BV/AABB.h"
#include "coal/broadphase/detail/morton.h"
#include "coal/broadphase/detail/node_base.h"
 
namespace coal {
 
namespace detail {
 
template <typename BV>
class HierarchyTree {
 public:
  typedef NodeBase<BV> Node;
 
  HierarchyTree(int bu_threshold_ = 16, int topdown_level_ = 0);
 
  ~HierarchyTree();
 
  void init(std::vector<Node*>& leaves, int level = 0);
 
  Node* insert(const BV& bv, void* data);
 
  void remove(Node* leaf);
 
  void clear();
 
  bool empty() const;
 
  void update(Node* leaf, int lookahead_level = -1);
 
  bool update(Node* leaf, const BV& bv);
 
  bool update(Node* leaf, const BV& bv, const Vec3s& vel, Scalar margin);
 
  bool update(Node* leaf, const BV& bv, const Vec3s& vel);
 
  size_t getMaxHeight() const;
 
  size_t getMaxDepth() const;
 
  void balanceBottomup();
 
  void balanceTopdown();
 
  void balanceIncremental(int iterations);
 
  void refit();
 
  void extractLeaves(const Node* root, std::vector<Node*>& leaves) const;
 
  size_t size() const;
 
  Node* getRoot() const;
 
  Node*& getRoot();
 
  void print(Node* root, int depth);
 
 private:
  typedef typename std::vector<NodeBase<BV>*>::iterator NodeVecIterator;
  typedef
      typename std::vector<NodeBase<BV>*>::const_iterator NodeVecConstIterator;
 
  struct SortByMorton {
    bool operator()(const Node* a, const Node* b) const {
      return a->code < b->code;
    }
  };
 
  void bottomup(const NodeVecIterator lbeg, const NodeVecIterator lend);
 
  Node* topdown(const NodeVecIterator lbeg, const NodeVecIterator lend);
 
  size_t getMaxHeight(Node* node) const;
 
  void getMaxDepth(Node* node, size_t depth, size_t& max_depth) const;
 
  Node* topdown_0(const NodeVecIterator lbeg, const NodeVecIterator lend);
 
  Node* topdown_1(const NodeVecIterator lbeg, const NodeVecIterator lend);
 
  void init_0(std::vector<Node*>& leaves);
 
  void init_1(std::vector<Node*>& leaves);
 
  void init_2(std::vector<Node*>& leaves);
 
  void init_3(std::vector<Node*>& leaves);
 
  Node* mortonRecurse_0(const NodeVecIterator lbeg, const NodeVecIterator lend,
                        const uint32_t& split, int bits);
 
  Node* mortonRecurse_1(const NodeVecIterator lbeg, const NodeVecIterator lend,
                        const uint32_t& split, int bits);
 
  Node* mortonRecurse_2(const NodeVecIterator lbeg, const NodeVecIterator lend);
 
  void update_(Node* leaf, const BV& bv);
 
  Node* sort(Node* n, Node*& r);
 
  //                  leaf node.
  void insertLeaf(Node* const sub_root, Node* const leaf);
 
  //           adjusted.
  Node* removeLeaf(Node* const leaf);
 
  void fetchLeaves(Node* root, std::vector<Node*>& leaves, int depth = -1);
 
  static size_t indexOf(Node* node);
 
  Node* createNode(Node* parent, const BV& bv, void* data);
 
  Node* createNode(Node* parent, const BV& bv1, const BV& bv2, void* data);
 
  Node* createNode(Node* parent, void* data);
 
  void deleteNode(Node* node);
 
  void recurseDeleteNode(Node* node);
 
  void recurseRefit(Node* node);
 
 protected:
  Node* root_node;
 
  size_t n_leaves;
 
  unsigned int opath;
 
  Node* free_node;
 
  int max_lookahead_level;
 
 public:
  int topdown_level;
 
  int bu_threshold;
};
 
template <typename BV>
bool nodeBaseLess(NodeBase<BV>* a, NodeBase<BV>* b, int d);
 
template <typename BV>
size_t select(const NodeBase<BV>& query, const NodeBase<BV>& node1,
              const NodeBase<BV>& node2);
 
template <typename BV>
size_t select(const BV& query, const NodeBase<BV>& node1,
              const NodeBase<BV>& node2);
 
}  // namespace detail
}  // namespace coal
 
#include "coal/broadphase/detail/hierarchy_tree-inl.h"
 
#endif