CGAL 5.1 - 2D and 3D Linear Geometry Kernel

#include <Concepts/FunctionObjectConcepts.h>

Definition

Operations

A model of this concept must provide:

bool operator() (const Kernel::Sphere_3 &s, const Kernel::Point_3 &p)
 returns true iff p lies on the bounded side of s. More...
 
bool operator() (const Kernel::Tetrahedron_3 &t, const Kernel::Point_3 &p)
 returns true iff p lies on the bounded side of t. More...
 
bool operator() (const Kernel::Iso_cuboid_3 &c, const Kernel::Point_3 &p)
 returns true iff p lies on the bounded side of c. More...
 
bool operator() (const Kernel::Sphere_3 &s1, const Kernel::Sphere_3 &s2, const Kernel::Point_3 &a, const Kernel::Point_3 &b)
 returns true iff the line segment ab is inside the union of the bounded sides of s1 and s2. More...
 

Member Function Documentation

◆ operator()() [1/4]

bool Kernel::HasOnBoundedSide_3::operator() ( const Kernel::Iso_cuboid_3 c,
const Kernel::Point_3 p 
)

returns true iff p lies on the bounded side of c.

◆ operator()() [2/4]

bool Kernel::HasOnBoundedSide_3::operator() ( const Kernel::Sphere_3 s,
const Kernel::Point_3 p 
)

returns true iff p lies on the bounded side of s.

◆ operator()() [3/4]

bool Kernel::HasOnBoundedSide_3::operator() ( const Kernel::Sphere_3 s1,
const Kernel::Sphere_3 s2,
const Kernel::Point_3 a,
const Kernel::Point_3 b 
)

returns true iff the line segment ab is inside the union of the bounded sides of s1 and s2.

◆ operator()() [4/4]

bool Kernel::HasOnBoundedSide_3::operator() ( const Kernel::Tetrahedron_3 t,
const Kernel::Point_3 p 
)

returns true iff p lies on the bounded side of t.