triangle_2d.h

Go to the documentation of this file.

/** @file
 *  @author Bram de Greve (bram@cocamware.com)
 *  @author Tom De Muer (tom@cocamware.com)
 *
 *  *** BEGIN LICENSE INFORMATION ***
 *  
 *  The contents of this file are subject to the Common Public Attribution License 
 *  Version 1.0 (the "License"); you may not use this file except in compliance with 
 *  the License. You may obtain a copy of the License at 
 *  http://lass.sourceforge.net/cpal-license. The License is based on the 
 *  Mozilla Public License Version 1.1 but Sections 14 and 15 have been added to cover 
 *  use of software over a computer network and provide for limited attribution for 
 *  the Original Developer. In addition, Exhibit A has been modified to be consistent 
 *  with Exhibit B.
 *  
 *  Software distributed under the License is distributed on an "AS IS" basis, WITHOUT 
 *  WARRANTY OF ANY KIND, either express or implied. See the License for the specific 
 *  language governing rights and limitations under the License.
 *  
 *  The Original Code is LASS - Library of Assembled Shared Sources.
 *  
 *  The Initial Developer of the Original Code is Bram de Greve and Tom De Muer.
 *  The Original Developer is the Initial Developer.
 *  
 *  All portions of the code written by the Initial Developer are:
 *  Copyright (C) 2004-2011 the Initial Developer.
 *  All Rights Reserved.
 *  
 *  Contributor(s):
 *
 *  Alternatively, the contents of this file may be used under the terms of the 
 *  GNU General Public License Version 2 or later (the GPL), in which case the 
 *  provisions of GPL are applicable instead of those above.  If you wish to allow use
 *  of your version of this file only under the terms of the GPL and not to allow 
 *  others to use your version of this file under the CPAL, indicate your decision by 
 *  deleting the provisions above and replace them with the notice and other 
 *  provisions required by the GPL License. If you do not delete the provisions above,
 *  a recipient may use your version of this file under either the CPAL or the GPL.
 *  
 *  *** END LICENSE INFORMATION ***
 */
 
 
 
/** @class lass::prim::Triangle2D
 *  @brief A very simple 2D polygon :)
 *  @author Bram de Greve [BdG]
 */
 
#ifndef LASS_GUARDIAN_OF_INCLUSION_PRIM_TRIANGLE_2D_H
#define LASS_GUARDIAN_OF_INCLUSION_PRIM_TRIANGLE_2D_H
 
#include "prim_common.h"
#include "line_segment_2d.h"
#include "orientation.h"
#include "side.h"
 
namespace lass
{
namespace prim
{
 
template <typename T>
class LASS_SIMD_ALIGN Triangle2D
{
public:
 
    typedef Triangle2D<T> TSelf;
 
    typedef Point2D<T> TPoint;
    typedef Point2DH<T> TPointH;
    typedef typename TPoint::TVector TVector;
    typedef LineSegment2D<T> TLineSegment;
 
    typedef typename TPoint::TValue TValue;
    typedef typename TPoint::TParam TParam;
    typedef typename TPoint::TReference TReference;
    typedef typename TPoint::TConstReference TConstReference;
    typedef typename TPoint::TNumTraits TNumTraits;
 
    enum { dimension = TPoint::dimension }; /**< number of dimensions */
 
    template <typename U> struct Rebind
    {
        typedef Triangle2D<U> Type;
    };
 
    Triangle2D();
    Triangle2D(const TPoint& iA, const TPoint& iB, const TPoint& iC);
 
    const TPoint& operator[](size_t iIndexOfVertex) const;
    TPoint& operator[](size_t iIndexOfVertex);
    const TPoint& at(int iIndexOfVertex) const;
    TPoint& at(int iIndexOfVertex);
    const TLineSegment edge(int iIndexOfTailVertex) const;
    const TVector vector(int iIndexOfTailVertex) const;
 
    bool isEmpty() const;
    int size() const;
 
    const TValue signedArea() const;
    const TValue area() const;
    const TValue perimeter() const;
    const TPointH vertexCentroid() const;
    const TPointH surfaceCentroid() const;
 
    bool isSimple() const;
    bool isConvex() const;
    bool isConcave() const;
    Orientation orientation() const;
 
    bool isReflex(int iIndexOfVertex) const;
 
    Side classify(const TPoint& iP) const;
    bool contains(const TPoint& iP) const;
 
    void flip();
 
private:
 
    bool isInRange(size_t iIndexOfVertex) const;
 
    enum { size_ = 3 };
 
    TPoint vertices_[size_];
};
 
template <typename T> const T distance(const Triangle2D<T>& triangle, const Point2D<T>& point);
template <typename T> bool intersects(const Triangle2D<T>& a, const Triangle2D<T>& b);
 
template <typename T>
io::XmlOStream& operator<<(io::XmlOStream& ioOStream, const Triangle2D<T>& iTriangle);
template <typename T>
std::ostream& operator<<(std::ostream& ioOStream, const Triangle2D<T>& iTriangle);
template<typename T>
lass::io::MatlabOStream& operator<<(lass::io::MatlabOStream& oOStream,
                                    const Triangle2D<T>& iTriangle);
 
template <typename T>
T partialVoronoiArea(const Triangle2D<T> iT, int iIndexOfVertex);
 
}
 
}
 
#include "triangle_2d.inl"
 
#ifdef LASS_GUARDIAN_OF_INCLUSION_PRIM_AABB_2D_H
#   include "aabb_2d_triangle_2d.h"
#endif
 
#ifdef LASS_GUARDIAN_OF_INCLUSION_PRIM_RAY_2D_H
#   include "ray_2d_triangle_2d.h"
#endif
 
#endif
 
// EOF