a_triangle.h

Go to the documentation of this file.

/*
         Copyright 2010-2019 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_TRIANGLE_H_
#define _A_TRIANGLE_H_
 
#include <iostream>
#include <stdlib.h>
#include "a_point.h"
#include "a_segment.h"
#include "a_mat_sq.h"
 
class a_triangle: public a_geom_base
{
        public:
                a_triangle() : p1_(), p2_(), p3_() {}
                a_triangle(const a_point& p1, const a_point& p2, const a_point& p3) : p1_(p1), p2_(p2), p3_(p3) {}
                a_triangle(const a_triangle& p) {p1_ = p.p1_; p2_ = p.p2_; p3_ = p.p3_;}
 
                virtual const std::string classname() { return "a_triangle";}
                static const std::string help();
                //: get points
                inline a_point  p1() const { return p1_; }
                inline a_point  p2() const { return p2_; }
                inline a_point  p3() const { return p3_; }
                inline a_point  operator[](const int i) const {if (i==0) return p1_; if (i==1) return p2_; if (i==2) return p3_; exit(1);}
                inline a_point  p(const int i) const {if (i==0) return p1_; if (i==1) return p2_; if (i==2) return p3_; exit(1);}
 
                //: set points
                inline void    p1(const a_point& v) { p1_ = v; }
                inline void    p2(const a_point& v) { p2_ = v; }
                inline void    p3(const a_point& v) { p3_ = v; }
                inline void     set(const a_point& p1, const a_point& p2, const a_point& p3) {p1_ = p1; p2_ = p2; p3_ = p3;}
 
                inline a_segment s1() const {return a_segment(p1_,p2_);}
                inline a_segment s2() const {return a_segment(p2_,p3_);}
                inline a_segment s3() const {return a_segment(p3_,p1_);}
                a_segment s(const int ref) const;
                inline a_point  c() const { return (p1_+p2_+p3_)/3.; }
                a_triangle& translate(double x, double y, double z);
                a_triangle& rotate(const a_point& x_axis, const a_point& y_axis, const a_point& z_axis);
                a_triangle& invert();
                a_point normal() const;
                double S() const;
                a_triangle shape() const; 
                a_mat_sq coord() const;
                a_mat_sq inertia() const;
                bool contains(const a_point& p) const;
                a_point closest(const a_point& p) const;
                a_point closestp(const a_point& p) const;
                double dist(const a_point& p) const;
                double distp(const a_point& p) const;
                a_segment intersect(const a_segment& s) const;
                double min_edge() const;
                double max_edge() const;
                double quality() const;
                bool operator==(const a_triangle& p);
                a_triangle& operator=(const a_triangle& p);
 
                //: input/output
                virtual void read(std::istream &i);
                virtual void write(std::ostream &o) const;
 
        protected:
                a_point   p1_;
                a_point   p2_;
                a_point   p3_;
};
 
#endif