CGAL 6.1.2 - 2D Regularized Boolean Set-Operations: Boolean_set_operations_2/do_intersect.cpp

CGAL 6.1.2 - 2D Regularized Boolean Set-Operations

Loading...
Searching...
No Matches
Boolean_set_operations_2/do_intersect.cpp
#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
#include <CGAL/Boolean_set_operations_2.h>
typedef CGAL::Exact_predicates_exact_constructions_kernel Kernel;
typedef Kernel::Point_2 Point_2;
typedef CGAL::Polygon_2<Kernel> Polygon_2;
#include "print_utils.h"
int main ()
{
Polygon_2 P;
P. push_back (Point_2 (-1,1));
P.push_back (Point_2 (0,-1));
P.push_back (Point_2 (1,1));
std::cout << "P = "; print_polygon (P);
Polygon_2 Q;
Q.push_back(Point_2 (-1,-1));
Q.push_back(Point_2 (1,-1));
Q.push_back(Point_2 (0,1));
std::cout << "Q = "; print_polygon (Q);
if ((CGAL::do_intersect (P, Q)))
std::cout << "The two polygons intersect in their interior." << std::endl;
else
std::cout << "The two polygons do not intersect." << std::endl;
return 0;
}
CGAL::Exact_predicates_exact_constructions_kernel
CGAL::Polygon_2
CGAL::Polygon_2::push_back
void push_back(const Point_2 &x)
Kernel::Point_2
CGAL::do_intersect
bool do_intersect(Type1< Kernel > obj1, Type2< Kernel > obj2)
Kernel