cgal_types2.h

CGAL is a collaborative effort of several sites in Europe and Israel. The goal is to make the most i

#ifndef CGAL_TYPES_HEADER
#define CGAL_TYPES_HEADER

#include <CGAL/basic.h>
#include <CGAL/Cartesian.h>
#include <CGAL/point_generators_2.h>
//#include <CGAL/Largest_empty_iso_rectangle_2.h>

#include <CGAL/MP_Float.h>
#include <CGAL/Quotient.h>
#include <CGAL/Arr_2_default_dcel.h>
#include <CGAL/Arr_segment_traits_2.h>
#include <CGAL/Arrangement_2.h>
#include <CGAL/squared_distance_2.h>
#include <CGAL/Polygon_2.h>

typedef CGAL::Quotient<CGAL::MP_Float>  Coord_type;
typedef CGAL::Cartesian<Coord_type> Rep;

typedef Rep::Point_2             Point;
typedef Rep::Segment_2           Segment;
//typedef Rep::Iso_rectangle_2     Iso_rectangle_2;


typedef CGAL::Quotient<CGAL::MP_Float>                  NT;
typedef CGAL::Cartesian<NT>                             Kernel;
typedef CGAL::Arr_segment_traits_2<Kernel>              Traits;

//typedef Traits::Point_2                                 Point;
typedef Traits::Curve_2                                 Curve;
typedef Traits::X_monotone_curve_2                      X_curve;

//a face with a counter for overlapping polygons (counter is initialized to -1)
struct Face_with_counter : public CGAL::Arr_2_face_base {
  Face_with_counter() : CGAL::Arr_2_face_base(), counter(-1) {}
  int counter;
};

typedef CGAL::Arr_base_node<Curve, X_curve>             Base_node;

//a DCEL with Face_with_counter
typedef CGAL::Pm_dcel<CGAL::Arr_2_vertex_base<Point>,
  CGAL::Arr_2_halfedge_base<Base_node >,
  Face_with_counter >  Dcel;


//typedef CGAL::Arr_2_default_dcel<Traits>                   Dcel;
//typedef CGAL::Planar_map_2<Dcel,Traits>                 Pm;
//typedef CGAL::Planar_map_with_intersections_2<Pm>       Pmwx;

typedef CGAL::Arrangement_2<Dcel, Traits, Base_node>    Arr;

typedef CGAL::Polygon_traits_2<Rep>         PT;
typedef std::vector<Point>                  Container;
typedef CGAL::Polygon_2<PT, Container>      Cgal_Polygon;

#endif