\( \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 5.0 - 2D and 3D Linear Geometry Kernel
Functions
CGAL::has_smaller_signed_distance_to_line()
2D and 3D Linear Geometry Kernel Reference » Global Kernel Functions

See also
CGAL::compare_distance_to_point()
CGAL::compare_signed_distance_to_line()
CGAL::compare_signed_distance_to_plane()
CGAL::has_larger_distance_to_point()
CGAL::has_larger_signed_distance_to_line()
CGAL::has_larger_signed_distance_to_plane()
CGAL::has_smaller_distance_to_point()
CGAL::has_smaller_signed_distance_to_plane()

Functions

template<typename Kernel >
bool CGAL::has_smaller_signed_distance_to_line (const CGAL::Line_2< Kernel > &l, const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q)
 returns true iff the signed distance of p and l is smaller than the signed distance of q and l.
 
template<typename Kernel >
bool CGAL::has_smaller_signed_distance_to_line (const CGAL::Point_2< Kernel > &p, const CGAL::Point_2< Kernel > &q, const CGAL::Point_2< Kernel > &r, const CGAL::Point_2< Kernel > &s)
 returns true iff the signed distance of r and l is smaller than the signed distance of s and l, where l is the oriented line through p and q.