CGAL 6.1.2 - 2D and 3D Linear Geometry Kernel: Kernel::HasOnBoundedSide_3 Concept Reference

CGAL 6.1.2 - 2D and 3D Linear Geometry Kernel

Loading...
Searching...
No Matches
List of all members
Kernel::HasOnBoundedSide_3 Concept Reference
Reference Manual » Concepts » Kernel Function Object Concepts

## Definition

Refines
  `AdaptableBinaryFunction`

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::Circle_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`.