shells/subdiv/Vertex.h

Go to the documentation of this file.

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

#include <map>
#include <algorithm>
#include <iostream>

#include "definitions.h"



namespace subdiv {
    
    class Vertex {
    public:     
        Vertex(int level=0){
            if (!_m_p[level]) {
                VecD3* newpoint = new VecD3();
                _m_p[level] = newpoint;
            }
            _corner = false;
            _crease = false; 
        }
        
        ~Vertex(){};    
        
        // iterators
        typedef std::map<int, VecD3*, std::greater<int> >::iterator LevelIterator;
        LevelIterator levBegin() {return _m_p.begin();}
        LevelIterator levEnd() {return _m_p.end();}
        
        // io
        friend void operator>>(std::istream& is, subdiv::Vertex* v) {
            VecD3* coor = v->_m_p[0];
            is >> (*coor)[0] >> (*coor)[1]  >> (*coor)[2];
        }
        friend std::ostream& operator<<(std::ostream& os, subdiv::Vertex* v) {
            VecD3* coor = v->_m_p.begin()->second;
            os << (*coor)[0] << " "<< (*coor)[1] << " "<< (*coor)[2];
            return os;
        }
        
        // interface
        int& number() {return _number;} 
        bool& corner() {return _corner;}
        bool& crease() {return _crease;}
        
        void addNewLevel(const VecD3& vec, int level){
            PointMap::iterator it = _m_p.find(level);       
            if (it != _m_p.end()) {
                *((*it).second) = vec;
            } else { 
                VecD3* newpoint = new VecD3(vec);
                _m_p.insert(PointMap::value_type(level, newpoint));  
            }
        }       
        
        int maxActiveLevel(){return _m_p.begin()->first;}

        VecD3& position(int level){return *(_m_p[level]);} 
        VecD3& position(){ return *(_m_p.begin()->second); } 
        
    private:
        int     _number;      // vertex number       
        bool    _corner;      // tag for corner   
        bool    _crease;      // tag for crease     
        
        typedef std::map<int, VecD3*, std::greater<int> >  PointMap;
        
        PointMap    _m_p;     // coordinates 
    };
    
}
#endif /* __Vertex_h__ */

---