CGAL::do_intersect() (2D Polygons)

See also

CGAL::do_intersect() (2D Circular Kernel)

CGAL::do_intersect() (3D Spherical Kernel)

CGAL::do_intersect() (2D/3D Linear Kernel)

CGAL::intersection()

Functions
template<class Polygon1 , class Polygon2 >
bool	CGAL::do_intersect (const Polygon1 &p1, const Polygon2 &p2)
	checks whether the polygons p1 and p2 intersect. More...

Function Documentation

do_intersect()

template<class Polygon1 , class Polygon2 >

bool CGAL::do_intersect	(	const Polygon1 &	p1,
		const Polygon2 &	p2
	)

#include <CGAL/do_polygons_intersect.h>

checks whether the polygons p1 and p2 intersect.

Polygon1 and Polygon2 can be an instantiation of one of the two polygon classes, namely CGAL::Polygon_2<K,C> or CGAL::Polygon_with_holes_2<K,C>. Two polygons are considered as intersecting iff there exists a point that is in both regions enclosed by the polygons (boundary included). If you are looking for a regularized do-intersect function (i.e. existence of an infinitesimal disk covered by both polygons), see the function CGAL::Regularized_boolean_operations_2::do_intersect() .

Note

This function depends on the package 2D Regularized Boolean Set-Operations and is documented here for convenience.