Point2.hpp

Go to the documentation of this file.

/*
   Copyright (C) 1997,1998,1999
   Kenji Hiranabe, Eiwa System Management, Inc.

   This program is free software.
   Implemented by Kenji Hiranabe(hiranabe@esm.co.jp),
   conforming to the Java(TM) 3D API specification by Sun Microsystems.

   Permission to use, copy, modify, distribute and sell this software
   and its documentation for any purpose is hereby granted without fee,
   provided that the above copyright notice appear in all copies and
   that both that copyright notice and this permission notice appear
   in supporting documentation. Kenji Hiranabe and Eiwa System Management,Inc.
   makes no representations about the suitability of this software for any
   purpose.  It is provided "AS IS" with NO WARRANTY.

   Copyright (C) 2004
   Rune Myrland, Skalden Studio AS
   SagaEngine adaptions. Kenji Hiranabe's license apply.
*/
#ifndef base_vecmath_Point2_hpp
#define base_vecmath_Point2_hpp

#include "util_vecmath.hpp"
#include "Vector2.hpp"
#include "Point3.hpp"

namespace se_core {
    class _SeCoreExport Point2 : public Vector2 {
    public:
        Point2(coor_t x, coor_t y): Vector2(x, y) { }

        Point2(const coor_t p[]): Vector2(p) { }

        Point2(const Tuple2& t1): Vector2(t1) { }

        Point2(): Vector2() { }


        inline void projectIsometric(Point3& p1) {
            x_ = p1.x_;
            y_ = CoorT::half(p1.z_) + CoorT::half(p1.y_);
        }


        inline void projectTopDown(Point3& p1) {
            x_ = p1.x_;
            y_ = p1.z_;
        }


        coor_double_t distanceSquared(const Point2& p1) const {
            coor_double_t dx = x_ - p1.x_;
            coor_double_t dy = y_ - p1.y_;
            return static_cast<coor_double_t>(dx)*dx + static_cast<coor_double_t>(dy)*dy;
        }

        coor_t distance(const Point2& p1) const;

        coor_t distanceL1(const Point2& p1) const;

        coor_t distanceLinf(const Point2& p1) const;

        scale_t lineIntersect(const Point2& a0, const Point2& a1, const Point2& b0, const Point2& b1);
        scale_t lineIntersect(const Point3& a0, const Point3& a1, const Point3& b0, const Point3& b1);

        bool willAIntersectB(const Point2& a0, const Point2& a1, const Point2& b0, const Point2& b1);
        bool willAIntersectB(const Point3& a0, const Point3& a1, const Point3& b0, const Point3& b1, float tolerance = 0);

        void nearestPoint(const Point2& pt1, const Point2& pt2, const Point2& testPoint);

        float left(const Point2& P0, const Point2& P1 ) const {
            return (P1.x_ - P0.x_) * (y_ - P0.y_) - (x_ - P0.x_) * (P1.y_ - P0.y_);
        }

        bool isLeft(const Point2& P0, const Point2& P1 ) const {
            return (0 > left(P0, P1));
        }

        // copy constructor and operator = is made by complier
        Point2& operator=(const Tuple2& t) {
            Tuple2::operator=(t);
            return *this;
        }
    };

} // Namespace


inline
se_core::Point2 operator*(scale_t s, const se_core::Point2& t1) {
    return operator*(s, (const se_core::Tuple2&)t1);
}


#endif /* POINT2_H */

---

Home Page | SagaEngine trunk (updated nightly) reference generated Sun Dec 2 20:06:13 2007 by Doxygen version 1.3.9.1.