triangulation.h

Go to the documentation of this file.

// -*-c++-*-

 
/*
 *Copyright:
 
 Copyright (C) Hidehisa Akiyama
 
 This code is free software; you can redistribute it and/or
 modify it under the terms of the GNU Lesser General Public
 License as published by the Free Software Foundation; either
 version 3 of the License, or (at your option) any later version.
 
 This library 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
 Lesser General Public License for more details.
 
 You should have received a copy of the GNU Lesser General Public
 License along with this library; if not, write to the Free Software
 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 
 *EndCopyright:
 */
 
#ifndef RCSC_GEOM_TRIANGULATION_USING_TRIANGLE_H
#define RCSC_GEOM_TRIANGULATION_USING_TRIANGLE_H
 
#include <geom/vector_2d.h>
 
#include <vector>
#include <set>
 
namespace rcsc {

class Triangulation {
public:
    struct Triangle {
        size_t v0_; 
        size_t v1_; 
        size_t v2_; 

        Triangle( const size_t v0,
                  const size_t v1,
                  const size_t v2 )
            : v0_( v0 )
            , v1_( v1 )
            , v2_( v2 )
          { }
    };
 
    typedef std::vector< Vector2D > PointCont; 
    typedef std::vector< Triangle > TriangleCont; 
    typedef std::pair< size_t, size_t > Segment; 
    typedef std::set< Segment > SegmentSet; 
    typedef std::vector< Segment > SegmentCont; 
 
private:
 
    bool M_use_triangles; 
    bool M_use_edges; 
 
#ifdef TRIANGULATION_STRICT_POINT_SET
    std::set< Vector2D, Vector2D::XYCmp > M_point_set; 
#endif
 
    PointCont M_points; 
    SegmentSet M_constraints; 
 
    TriangleCont M_triangles; 
    SegmentCont M_edges; 
 
public:
    Triangulation()
        : M_use_triangles( true )
        , M_use_edges( true )
      { }

    void clear();

    void clearResults();

    const PointCont & points() const
      {
          return M_points;
      }

    const SegmentSet & constraints() const
      {
          return M_constraints;
      }

    const TriangleCont & triangles() const
      {
          return M_triangles;
      }

    const SegmentCont & edges() const
      {
          return M_edges;
      }

    void setUseTriangles( const bool on )
      {
          M_use_triangles = on;
      }

    void setUseEdges( const bool on )
      {
          M_use_edges = on;
      }

    bool addPoint( const Vector2D & p );

    size_t addPoints( const PointCont & v );

    bool addConstraint( const size_t & origin_index,
                        const size_t & terminal_index );

    void compute();

    const Triangle * findTriangleContains( const Vector2D & point ) const;

    int findNearestPoint( const Vector2D & point ) const;
};
 
}
 
#endif