voronoi_diagram.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_VORONOI_DIAGRAM_H
#define RCSC_GEOM_VORONOI_DIAGRAM_H
 
#include <rcsc/geom/vector_2d.h>
#include <rcsc/geom/segment_2d.h>
#include <rcsc/geom/ray_2d.h>
#include <rcsc/geom/rect_2d.h>
#include <rcsc/geom/delaunay_triangulation.h>
 
#include <vector>
#include <set>
 
namespace rcsc {
 
class VoronoiDiagram {
public:
    typedef std::set< Vector2D, Vector2D::XYCmp > Vector2DCont;
    typedef std::vector< Segment2D > Segment2DCont;
    typedef std::vector< Ray2D > Ray2DCont;
 
private:
 
    Rect2D * M_bounding_rect;
 
    DelaunayTriangulation M_triangulation;
 
    Vector2DCont M_vertices; 
    Segment2DCont M_segments; 
    Ray2DCont M_rays; 
 
public:
    VoronoiDiagram();
 
    VoronoiDiagram( const std::vector< Vector2D > & v );
 
    ~VoronoiDiagram();
 
    void setBoundingRect( const Rect2D & rect );
 
    void addPoint( const Vector2D & p )
      {
          M_triangulation.addVertex( p );
      }
 
    void addPoint( const std::vector< Vector2D > & v )
      {
          M_triangulation.addVertices( v );
      }
 
    void clear();
 
    void clearBoundingRect();
 
    void clearResults();
 
    void compute();
 
    const DelaunayTriangulation & triangulation() const
      {
          return M_triangulation;
      }
 
    const Vector2DCont & vertices() const
      {
          return M_vertices;
      }
    const Vector2DCont & resultPoints() const
      {
          return M_vertices;
      }
 
    const Segment2DCont & segments() const
      {
          return M_segments;
      }
    const Segment2DCont & resultSegments() const
      {
          return M_segments;
      }
 
    const Ray2DCont & rays() const
    {
        return M_rays;
    }
    const Ray2DCont & resultRays() const
      {
          return M_rays;
      }
 
    void getPointsOnSegments( const double min_length,
                              const unsigned int max_division,
                              std::vector< Vector2D > * result ) const;
};
 
}
 
#endif