shells/subdiv/TTree.h

Go to the documentation of this file.

// -*- C++ -*-
//
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
//
//                                   Fehmi Cirak   
//                       California Institute of Technology
//                          (C) 2003 All Rights Reserved
//
// <LicenseText>
//
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
//
#ifndef __TTree_h__
#define __TTree_h__

#include <iterator>


namespace subdiv {

    template <typename V>
    class Averaging;
        
    template <typename V>
    class TTree {
    public:     
        TTree(V *vtx[3], int depth, TTree* parent) {
            _m_v[0] = vtx[0];
            _m_v[1] = vtx[1];
            _m_v[2] = vtx[2];
            
            _m_p = parent;
            
            _m_c[0] = NULL;
            _m_c[1] = NULL;
            _m_c[2] = NULL;
            _m_c[3] = NULL;
            
            _m_t[0] = NULL;
            _m_t[1] = NULL; 
            _m_t[2] = NULL;

            _m_depth = depth;
        }       


        ~TTree(void) {}
        
        // interface
        V*& vertex(int i){return _m_v[i];}

        TTree<V>*& neighbor(int i){return _m_t[i];}
        TTree<V>*& parent(void){return _m_p;}
        TTree<V>*& child(int i){return _m_c[i];}
        
        // output
        template <typename  OutputIterator>
        void addLeafs(OutputIterator iter);
        
        void subdivide(Averaging<V> *avrg);
        bool leaf(void ){
            return (!_m_c[0] && !_m_c[1] && !_m_c[2] && !_m_c[3]);
        }
        
    private:
        V              *_m_v[3];           // vertices
        TTree<V>       *_m_p;              // parent pointer 
        TTree<V>       *_m_c[4];           // child pointers     
        TTree<V>       *_m_t[3];           // neighbors
        
        int             _m_depth;          // depth of the refinement

        // private methods
        void newCoordEdgeVertices(V* vtx[3], Averaging<V> *avrg);
        void newCoordExistingVertices(Averaging<V> *avrg);
        
        V* findNeighborVertex (int );
        V* makeOrFindVertex (int );     
        void createNewElements(Averaging<V> *avrg);
        void subdivideLeaf(Averaging<V> *avrg);
    }; 
    
}


// helper function
namespace subdiv {

    template <typename V> 
    int localVtxNumber(TTree<V> *tt, V* vtx){
        int j = (tt->vertex(0) == vtx) ? 0 : ((tt->vertex(1) == vtx) ? 1 : 
                                              ((tt->vertex(2) == vtx) ? 2 : 3));    
        assert(j!=3);
        return j;
    }    

}


#include "TTree.cc"


#endif /*__TTree_h__*/

---