CGAL 5.6 - 2D and 3D Linear Geometry Kernel

See also
CGAL::do_intersect() (2D Circular Kernel)
CGAL::do_intersect() (3D Spherical Kernel)
Intersection Computation Functions - CGAL::intersection()

See Chapter 2D and 3D Geometry Kernel for details on a linear kernel instantiation.

Functions

bool CGAL::do_intersect (Type1< Kernel > obj1, Type2< Kernel > obj2)
 checks whether obj1 and obj2 intersect. More...
 
bool CGAL::do_intersect (Plane_3< Kernel > obj1, Plane_3< Kernel > obj2, Plane_3< Kernel > obj3)
 checks whether obj1, obj2 and obj3 intersect.
 

Function Documentation

◆ do_intersect()

bool CGAL::do_intersect ( Type1< Kernel obj1,
Type2< Kernel obj2 
)

#include <CGAL/intersections.h>

checks whether obj1 and obj2 intersect.

Two objects obj1 and obj2 intersect if there is a point p that is part of both obj1 and obj2. The intersection region of those two objects is defined as the set of all points p that are part of both obj1 and obj2. Note that for objects like triangles and polygons that enclose a bounded region, this region is part of the object.

The types Type1 and Type2 can be any of the following:

Also, Type1 and Type2 can be both of type

In three-dimensional space, the types Type1 and Type2 can be any of the following: