CGAL 6.1 - 2D and 3D Linear Geometry Kernel
|
#include <Concepts/FunctionObjectConcepts.h>
AdaptableBinaryFunction
CGAL::Line_2<Kernel>
Operations | |
A model of this concept must provide: | |
Kernel::Point_2 | operator() (const Kernel::Line_2 &l, const Kernel::Point_2 &p) |
returns the orthogonal projection of p onto l . | |
Kernel::Point_2 | operator() (const Kernel::Segment_2 &s, const Kernel::Point_2 &p) |
returns the point of s that is the closest to p . | |
Kernel::Point_2 | operator() (const Kernel::Triangle_2 &t, const Kernel::Point_3 &p) |
returns the point of t that is the closest to p . | |
Kernel::Point_2 Kernel::ConstructProjectedPoint_2::operator() | ( | const Kernel::Line_2 & | l, |
const Kernel::Point_2 & | p | ||
) |
returns the orthogonal projection of p
onto l
.
Kernel::Point_2 Kernel::ConstructProjectedPoint_2::operator() | ( | const Kernel::Segment_2 & | s, |
const Kernel::Point_2 & | p | ||
) |
returns the point of s
that is the closest to p
.
Kernel::Point_2 Kernel::ConstructProjectedPoint_2::operator() | ( | const Kernel::Triangle_2 & | t, |
const Kernel::Point_3 & | p | ||
) |
returns the point of t
that is the closest to p
.