a_structure.h

Go to the documentation of this file.

/*
Copyright 2010-2014 Pierre SMARS (smars@yuntech.edu.tw)
This program 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 2 of the License, or
(at your option) any later version.
 
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 General Public License for more details.
 
You should have received a copy of the GNU General Public License
along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef _A_STRUCTURE_H_
#define _A_STRUCTURE_H_
 
#include <iostream>
#include <vector>
#include "a_block.h"
#include "a_ocriteria.h"
#include "a_trianglecloud.h"
#include "a_linecloud.h"
 
class a_structure
{
public:
        a_structure(); 
        ~a_structure();
        void clear();
        static const std::string help();
        int nb() const {return blocks_.size();}
        int rb(const a_block* b) const;
        double V() const;
        a_point c() const;
        double m() const;
        double Ws() const;
        a_wrench W();
        a_wrench fe();
        a_wrench ft();
        double potential() const;
        int add_block(a_block * b);
        void link_blocks(int b1, int f1, int b2, int f2);
        a_block * b(const int i) const;
        bool connected() const;
        std::vector<int> out() const;
        std::vector<int> in() const;
        std::vector<int> nodes() const;
        void clearinternal();
        void clearexternal();
        void clearall();
        void objective(a_ocriteria * objective) {objective_=objective;}
        double objective() const;
        void criteria(a_fcriteria * criteria); 
        bool ok() const;
        double penalty() const;
        void penalty_factor(const double v) {penalty_factor_=v;}
        double penalty_factor() const {return penalty_factor_;}
        double objectivep() const;
        void rotate(int rb, int f, const a_point& x, const a_point& dir, double r);
        void rotate(int b, int f, double v, double r);
        void slide(int b, int f, double u, double v);
        void material(a_material * material);
        a_block * compute(int b, int f);
        //rb1: block reference (1st block is 0) rb1 should be in between rf1 and rf3!!!
        //rb2: rb2 should be in between rb1 and rb3
        //rb3: rb3 should be in between rf1 and rf3!!!
        //rfi: face of the block
        //ui: excentricity in the direction of u in local reference system of face (def depends of face)
        //uj: excentricity in the direction of v in local reference system of face (def depends of face)
        void compute(   const int rb1, const int rf1, const double u1, const double v1,
        const int rb2, const int rf2, const double u2, const double v2,
        const int rb3, const int rf3, const double u3, const double v3);
        double min(     const int face,
        const int rb1, const int rf1, const double u1,
        const int rb2, const int rf2, const double u2,
        const int rb3, const int rf3, const double u3);
        double mindir(  const a_point & dir,
        const int rb1, const int rf1, double &u1,
        const int rb2, const int rf2, double &u2,
        const int rb3, const int rf3, double &u3);
        double max(     const int face,
        const int rb1, const int rf1, const double u1,
        const int rb2, const int rf2, const double u2,
        const int rb3, const int rf3, const double u3);
        void min(       const int rb1, const int rf1,
        const int rb2, const int rf2);
        void max(       const int rb1, const int rf1,
        const int rb2, const int rf2);
        void minsteep(    const int rb1, const int rf1,
        const int rb2, const int rf2);
        virtual void writetri(std::ostream &o) const;
        virtual void writeb(std::ostream &o) const;
        virtual void writeg(std::ostream &o) const;
        void trianglecloud(a_trianglecloud&) const;
        void polyline(a_linecloud&) const;
        friend   std::istream&    operator>> (std::istream& i, a_structure& s);
        friend   std::ostream&    operator<< (std::ostream& o, const a_structure& s);
 
        class range_error {};
 
protected:
        bool check_block(const int rb) const;
        bool check_blockref(const int rb, const int rf) const;
        bool faceonexit(const int rb1, const int rf1, const int rb2, const int rf2);
        void midblock(  const int rb1, const int rf1,
        const int rb2, const int rf2,
        a_block *& rb, int&rf);
        void optimise(  const bool is_min,
        const int rb1, const int rf1,
        const int rb2, const int rf2);
        void storeexits(std::vector<int>&) const;
        void restoreexits(std::vector<int>&);
        double grad1(   const int rb1, const int rf1, 
                const int rb2, const int rf2,
                const int rb3, const int rf3, const double * u);
        double grad2(   const int rb1, const int rf1, 
                const int rb2, const int rf2,
                const int rb3, const int rf3,
                const double * u);
        double grad3(   const int rb1, const int rf1, 
                        const int rb2, const int rf2,
                        const int rb3, const int rf3,
                     const double * u);
        std::vector<a_block *> blocks_;
        a_ocriteria * objective_;
        double penalty_factor_;
};
 
#endif