Processing math: 0%
\newcommand{\E}{\mathrm{E}} \newcommand{\A}{\mathrm{A}} \newcommand{\R}{\mathrm{R}} \newcommand{\N}{\mathrm{N}} \newcommand{\Q}{\mathrm{Q}} \newcommand{\Z}{\mathrm{Z}} \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }
CGAL 4.12 - 2D and 3D Linear Geometry Kernel
•All Classes Namespaces Files Functions Variables Typedefs Enumerations Friends Modules Pages
List of all members
Kernel::HasOnBoundedSide_3 Concept Reference
2D and 3D Linear Geometry Kernel Reference » Concepts » Kernel Function Object Concepts

Definition

Refines:
AdaptableFunctor (with two arguments)
See also
CGAL::Iso_cuboid_3<Kernel>
CGAL::Sphere_3<Kernel>
CGAL::Tetrahedron_3<Kernel>
Kernel::HasOnUnboundedSide_3
Kernel::HasOnBoundary_3
Kernel::BoundedSide_3

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.
 
bool operator() (const Kernel::Tetrahedron_3 &t, const Kernel::Point_3 &p)
 returns true iff p lies on the bounded side of t.
 
bool operator() (const Kernel::Iso_cuboid_3 &c, const Kernel::Point_3 &p)
 returns true iff p lies on the bounded side of c.
 
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.