Simplex.h

Go to the documentation of this file.

/*
 *  Copyright (C) 2012 Josh Bialkowski (jbialk@mit.edu)
 *
 *  This file is part of mpblocks.
 *
 *  mpblocks is free software: you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation, either version 3 of the License, or
 *  (at your option) any later version.
 *
 *  mpblocks 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 General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with mpblocks.  If not, see <http://www.gnu.org/licenses/>.
 */
#ifndef MPBLOCKS_SIMPLEX_TREE_SIMPLEX_H_
#define MPBLOCKS_SIMPLEX_TREE_SIMPLEX_H_

#include <Eigen/Dense>
#include <vector>
#include <list>

namespace mpblocks     {
namespace simplex_tree {


template <class Traits>
class Simplex
{
    public:
        typedef Simplex<Traits>                 Simplex_t;
        typedef typename Traits::Format         Format_t;
        typedef typename Traits::Node           Node_t;

        typedef unsigned int                                        Index_t;
        typedef Eigen::Matrix<Format_t,Traits::NDim,1>              Vector_t;
        typedef Eigen::Matrix<Format_t,Traits::NDim,1>              Point_t;
        typedef Eigen::Matrix<Format_t,Traits::NDim+1,Traits::NDim> Normals_t;
        typedef Eigen::Matrix<Format_t,Traits::NDim+1,1>            Offsets_t;

        typedef std::vector<Simplex_t*>     SimplexList_t;
        typedef std::vector<Node_t*>        NodeList_t;

    protected:
        Index_t     m_idx;  
        Point_t     m_v;    

        Normals_t   m_n;    
        Offsets_t   m_d;    

        SimplexList_t m_children;  
        SimplexList_t m_neighbors; 

        NodeList_t  m_points;   

        void split();

    public:
        bool isInterior(){ return m_children.size() == 0; }
        bool isLeaf()    { return !isInterior(); }

        void initAsLeaf(Simplex_t* parent, Index_t i, Point_t& v);

        bool contains( Node_t* );

        void insert( Node_t* );

        void setFace(Index_t i, const Vector_t& n, Format_t d );




};






}   // namespace simplex_tree
}   // namespace mpblocks












#endif // SIMPLEX_H_