a_contact.cxx

Go to the documentation of this file.

/*
Copyright 2010-2011 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/>.
*/
#include <math.h>
#include "a_contact.h"
#include "a_debug.h"
 
const double verysmall=1.e-10;
//---------------------------------------------------------------------------
a_contact::a_contact(const a_contact& c)
{
        vertices_.clear();
        for (int i=0; i<c.nv(); i++)
                this->av(c.v(i));
        f_ = c.f();
}
//---------------------------------------------------------------------------
a_segment a_contact::s(const int i) const
{
        int n=this->nv();
        return a_segment(this->v(i%n),this->v((i+1)%n));
}
//---------------------------------------------------------------------------
void a_contact::clean()
{
        const int n = this->nv();
        if (n<3)
                return;
        a_contact c2;
        c2.av(this->v(0));
        int i = 0;
        while (i<n-2)
        {
                a_point p1 = this->v(i);
                a_segment s1(p1,this->v(i+1));
                a_point d1 = s1.dir();
                int k;
                double c;
                k = i+2;
                do 
                {
                        a_segment s2(p1,this->v(k));
                        a_point d2 = s2.dir();
                        c = fabs(d1*d2);
                        k++;
                } while ((c<verysmall)&&(k<n));
                i = k-1;
                c2.av(this->v(i));
        }
        if (i!=n-1)
               c2.av(this->v(n-1));
        (*this) = c2;
}
//***************************************************************************
//---------------------------------------------------------------------------
void a_contact::read(std::istream &in)
{
        int nv;
        in >> nv;
        vertices_.clear();
        for (int i=0; i<nv; i++)
        {
                a_point pt;
                in >> pt;
                vertices_.push_back(pt);
        }
}
//---------------------------------------------------------------------------
void a_contact::write(std::ostream &o) const
{
        o << this->nv() << " ";
        for (int i=0; i<this->nv(); i++)
                o << this->v(i) << " ";
        o << std::endl;
}
//-operator>>----------------------------------------------------------------
std::istream& operator>> (std::istream& in, a_contact& c)
{
        c.read(in);
        return in;
}
//-operator<<----------------------------------------------------------------
std::ostream& operator<< (std::ostream& o, const a_contact& c)
{
        c.write(o);
        return o;
}