traverser_project_point.h

Go to the documentation of this file.

/*
 * Copyright (c) 2007-2015:  Sebastian Reiter
 * Author: Sebastian Reiter
 * 
 * This file is part of UG4.
 * 
 * UG4 is free software: you can redistribute it and/or modify it under the
 * terms of the GNU Lesser General Public License version 3 (as published by the
 * Free Software Foundation) with the following additional attribution
 * requirements (according to LGPL/GPL v3 §7):
 * 
 * (1) The following notice must be displayed in the Appropriate Legal Notices
 * of covered and combined works: "Based on UG4 (www.ug4.org/license)".
 * 
 * (2) The following notice must be displayed at a prominent place in the
 * terminal output of covered works: "Based on UG4 (www.ug4.org/license)".
 * 
 * (3) The following bibliography is recommended for citation and must be
 * preserved in all covered files:
 * "Reiter, S., Vogel, A., Heppner, I., Rupp, M., and Wittum, G. A massively
 *   parallel geometric multigrid solver on hierarchically distributed grids.
 *   Computing and visualization in science 16, 4 (2013), 151-164"
 * "Vogel, A., Reiter, S., Rupp, M., Nägel, A., and Wittum, G. UG4 -- a novel
 *   flexible software system for simulating pde based models on high performance
 *   computers. Computing and visualization in science 16, 4 (2013), 165-179"
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU Lesser General Public License for more details.
 */
 
#ifndef __H__UG__NODE_TREE__TRAVERSER_PROJECT_POINT__
#define __H__UG__NODE_TREE__TRAVERSER_PROJECT_POINT__
 
#include "common/math/ugmath.h"
#include "traverser_collision_tree.h"
 
namespace ug{
namespace node_tree
{
class Traverser_ProjectPoint : protected Traverser_CollisionTree
{
  public:
    Traverser_ProjectPoint();
    virtual ~Traverser_ProjectPoint();
 
    virtual bool project(const vector3& point, SPNode nodeGraph,
              vector3* pPointNormal = NULL);
 
    CollisionElementID get_closest_element_id();
    
 
    int get_closest_element_type();
    
    inline number get_distance()      {return m_distance;}
    
    inline vector3 get_closest_point()    {return m_closestPoint;}
    
  protected:
    virtual void handle_group(GroupNode* group);
    virtual void handle_boxed_group(BoxedGroupNode* boxedGroup);
    virtual void handle_collision_edges(CollisionEdgesNode* colTrisNode);
    virtual void handle_collision_triangles(CollisionTrianglesNode* colTrisNode);
    
  protected:
    enum SearchState
    {
      SEARCHING = 0,
      FORCE_FIND,
      GOT_ONE
    };
 
    vector3 m_point;
    vector3 m_closestPoint;
    number  m_distance;
 
  private:
    SearchState     m_searchState;
    bool  m_checkNormals;
    vector3 m_pointNormal;
    
    vector3 m_boxMin;
    vector3 m_boxMax;
 
    int           m_closestElemIndices[3];
    int           m_closestElemType;
    CollisionElementID    m_closestElemID;
    CollisionTreeRootNode*  m_closestRootNode;
};
 
}// end of namespace node_tree
}// end of namespace ug
 
#endif