Line data    Source code

       1              : /*
       2              :  * Copyright (c) 2010-2015:  G-CSC, Goethe University Frankfurt
       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 "traverser_collision_tree.h"
      34              : #include "../node_tree.h"
      35              : 
      36              : namespace ug{
      37              : namespace node_tree
      38              : {
      39              : 
      40            0 : Traverser_CollisionTree::Traverser_CollisionTree()
      41              : {
      42              : //      register handler functions
      43            0 :         register_handler_function(OC_COLLISION_TREE_ROOT_NODE,
      44              :                                                         &Traverser_CollisionTree::handle_collision_tree_root);
      45            0 :         register_handler_function(OC_COLLISION_EDGES_NODE,
      46              :                                                         &Traverser_CollisionTree::handle_collision_edges);
      47            0 :         register_handler_function(OC_COLLISION_TRIANGLES_NODE,
      48              :                                                         &Traverser_CollisionTree::handle_collision_triangles);
      49            0 : }
      50              : 
      51            0 : Traverser_CollisionTree::~Traverser_CollisionTree()
      52              : {
      53            0 : }
      54              : 
      55            0 : void Traverser_CollisionTree::
      56              : handle_collision_tree_root(CollisionTreeRootNode* colTreeRootNode)
      57              : {
      58              :         //std::cout << "handling collision tree root" << std::endl;
      59              : 
      60              : //      put the rootNode on top of the stack.
      61              : //      All CollisionEdgeNodes children will index it's points
      62              :         m_stackRootNodes.push(colTreeRootNode);
      63              : 
      64              : //      traverse the node
      65            0 :         handle_boxed_group(colTreeRootNode);
      66              : 
      67              : //      pop the rootNode from the stack
      68              :         m_stackRootNodes.pop();
      69            0 : }
      70              : 
      71            0 : void Traverser_CollisionTree::
      72              : handle_collision_edges(CollisionEdgesNode* colEdgesNode)
      73              : {
      74              :         //std::cout << "handling collision edges" << std::endl;
      75            0 : }
      76              : 
      77            0 : void Traverser_CollisionTree::
      78              : handle_collision_triangles(CollisionTrianglesNode* colTrisNode)
      79              : {
      80              :         //std::cout << "handling collision edges" << std::endl;
      81            0 : }
      82              : 
      83            0 : CollisionTreeRootNode* Traverser_CollisionTree::
      84              : get_current_root_node()
      85              : {
      86              :         assert(!m_stackRootNodes.empty() && "Make sure that your collision tree"
      87              :                         " contains a CollisionTreeRootNode!");
      88            0 :         return m_stackRootNodes.top();
      89              : }
      90              : 
      91              : }//     end of namespace node_tree
      92              : }//     end of namespace ug