Line data    Source code

       1              : /*
       2              :  * Copyright (c) 2007-2015:  Sebastian Reiter
       3              :  * Author: Sebastian Reiter
       4              :  * 
       5              :  * This file is part of UG4.
       6              :  * 
       7              :  * UG4 is free software: you can redistribute it and/or modify it under the
       8              :  * terms of the GNU Lesser General Public License version 3 (as published by the
       9              :  * Free Software Foundation) with the following additional attribution
      10              :  * requirements (according to LGPL/GPL v3 §7):
      11              :  * 
      12              :  * (1) The following notice must be displayed in the Appropriate Legal Notices
      13              :  * of covered and combined works: "Based on UG4 (www.ug4.org/license)".
      14              :  * 
      15              :  * (2) The following notice must be displayed at a prominent place in the
      16              :  * terminal output of covered works: "Based on UG4 (www.ug4.org/license)".
      17              :  * 
      18              :  * (3) The following bibliography is recommended for citation and must be
      19              :  * preserved in all covered files:
      20              :  * "Reiter, S., Vogel, A., Heppner, I., Rupp, M., and Wittum, G. A massively
      21              :  *   parallel geometric multigrid solver on hierarchically distributed grids.
      22              :  *   Computing and visualization in science 16, 4 (2013), 151-164"
      23              :  * "Vogel, A., Reiter, S., Rupp, M., Nägel, A., and Wittum, G. UG4 -- a novel
      24              :  *   flexible software system for simulating pde based models on high performance
      25              :  *   computers. Computing and visualization in science 16, 4 (2013), 165-179"
      26              :  * 
      27              :  * This program is distributed in the hope that it will be useful,
      28              :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
      29              :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
      30              :  * GNU Lesser General Public License for more details.
      31              :  */
      32              : 
      33              : #include "collision_tree_root_node.h"
      34              : 
      35              : namespace ug{
      36              : namespace node_tree
      37              : {
      38              : 
      39              : ////////////////////////////////////////////////////////////////////////////////////////////////
      40            0 : SPCollisionTreeRootNode CollisionTreeRootNode::create()
      41              : {
      42            0 :         CollisionTreeRootNode* node = new CollisionTreeRootNode;
      43            0 :         node->m_objectCode = OC_COLLISION_TREE_ROOT_NODE;
      44            0 :         return SPCollisionTreeRootNode(node);
      45              : }
      46              : 
      47              : ////////////////////////////////////////////////////////////////////////////////////////////////
      48            0 : CollisionTreeRootNode::CollisionTreeRootNode()
      49              : {
      50            0 : }
      51              : 
      52            0 : CollisionTreeRootNode::~CollisionTreeRootNode()
      53              : {
      54            0 : }
      55              : 
      56            0 : void CollisionTreeRootNode::clear_points()
      57              : {
      58              :         m_vPoints.clear();
      59            0 : }
      60              : 
      61            0 : int CollisionTreeRootNode::num_points()
      62              : {
      63            0 :         return m_vPoints.size();
      64              : }
      65              : 
      66            0 : void CollisionTreeRootNode::add_points(vector3* pPoints, int numPoints)
      67              : {
      68            0 :         for(int i = 0; i < numPoints; ++i)
      69            0 :                 m_vPoints.push_back(pPoints[i]);
      70            0 : }
      71              : 
      72            0 : const vector3& CollisionTreeRootNode::get_point(int index) const
      73              : {
      74            0 :         return m_vPoints[index];
      75              : }
      76              : 
      77            0 : const vector3* CollisionTreeRootNode::get_points() const
      78              : {
      79            0 :         return &m_vPoints.front();
      80              : }
      81              : 
      82              : }//     end of namespace node_tree
      83              : }//     end of namespace ug