SPAR/AIModule/BWTA/vendors/CGAL/CGAL/Kernel/global_functions_2.h File Reference

#include <CGAL/user_classes.h>
#include <CGAL/Kernel/global_functions_internal_2.h>
#include <CGAL/Kernel/mpl.h>

Include dependency graph for global_functions_2.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
template<class K >
CGAL_BEGIN_NAMESPACE K::Boolean	operator== (const Point_2< K > &p, const Origin &o)
template<class K >
K::Boolean	operator!= (const Point_2< K > &p, const Origin &o)
template<class K >
Angle	angle (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r)
template<class K >
K::Boolean	are_ordered_along_line (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r)
template<class K >
K::Boolean	are_strictly_ordered_along_line (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r)
template<class K >
K::FT	area (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r)
template<class K >
K::Point_2	barycenter (const Point_2< K > &p1, const typename K::FT &w1, const Point_2< K > &p2)
template<class K >
K::Point_2	barycenter (const Point_2< K > &p1, const typename K::FT &w1, const Point_2< K > &p2, const typename K::FT &w2)
template<class K >
K::Point_2	barycenter (const Point_2< K > &p1, const typename K::FT &w1, const Point_2< K > &p2, const typename K::FT &w2, const Point_2< K > &p3)
template<class K >
K::Point_2	barycenter (const Point_2< K > &p1, const typename K::FT &w1, const Point_2< K > &p2, const typename K::FT &w2, const Point_2< K > &p3, const typename K::FT &w3)
template<class K >
K::Point_2	barycenter (const Point_2< K > &p1, const typename K::FT &w1, const Point_2< K > &p2, const typename K::FT &w2, const Point_2< K > &p3, const typename K::FT &w3, const Point_2< K > &p4)
template<class K >
K::Point_2	barycenter (const Point_2< K > &p1, const typename K::FT &w1, const Point_2< K > &p2, const typename K::FT &w2, const Point_2< K > &p3, const typename K::FT &w3, const Point_2< K > &p4, const typename K::FT &w4)
template<typename K >
K::Line_2	bisector (const Point_2< K > &p, const Point_2< K > &q)
template<typename K >
K::Line_2	bisector (const Line_2< K > &l1, const Line_2< K > &l2)
template<class K >
K::Point_2	centroid (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r)
template<class K >
K::Point_2	centroid (const Triangle_2< K > &t)
template<class K >
K::Point_2	centroid (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r, const Point_2< K > &s)
template<class K >
K::Point_2	circumcenter (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Point_2	circumcenter (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r)
template<class K >
K::Point_2	circumcenter (const Triangle_2< K > &t)
template<class K >
K::Boolean	collinear (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r)
template<class K >
K::Boolean	collinear_are_ordered_along_line (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r)
template<class K >
K::Boolean	collinear_are_strictly_ordered_along_line (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r)
template<typename K >
K::Comparison_result	compare_angle_with_x_axis (const Direction_2< K > &d1, const Direction_2< K > &d2)
template<class K >
K::Comparison_result	compare_distance_to_point (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r)
template<class K >
K::Comparison_result	compare_squared_distance (const Point_2< K > &p, const Point_2< K > &q, const typename K::FT &d2)
template<class K >
K::Comparison_result	compare_signed_distance_to_line (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r, const Point_2< K > &s)
template<class K >
K::Comparison_result	compare_signed_distance_to_line (const Line_2< K > &l, const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Comparison_result	compare_slopes (const Line_2< K > &l1, const Line_2< K > &l2)
template<class K >
K::Comparison_result	compare_slopes (const Segment_2< K > &s1, const Segment_2< K > &s2)
template<class K >
K::Comparison_result	compare_x (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Comparison_result	compare_x (const Point_2< K > &p, const Line_2< K > &l1, const Line_2< K > &l2)
template<class K >
K::Comparison_result	compare_x (const Line_2< K > &l, const Line_2< K > &h1, const Line_2< K > &h2)
template<class K >
K::Comparison_result	compare_x (const Line_2< K > &l1, const Line_2< K > &h1, const Line_2< K > &l2, const Line_2< K > &h2)
template<class K >
K::Comparison_result	compare_x_at_y (const Point_2< K > &p, const Line_2< K > &h)
template<class K >
K::Comparison_result	compare_x_at_y (const Point_2< K > &p, const Line_2< K > &h1, const Line_2< K > &h2)
template<class K >
K::Comparison_result	compare_x_at_y (const Line_2< K > &l1, const Line_2< K > &l2, const Line_2< K > &h)
template<class K >
K::Comparison_result	compare_x_at_y (const Line_2< K > &l1, const Line_2< K > &l2, const Line_2< K > &h1, const Line_2< K > &h2)
template<class K >
K::Comparison_result	compare_xy (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Comparison_result	compare_y (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Comparison_result	compare_y (const Point_2< K > &p, const Line_2< K > &l1, const Line_2< K > &l2)
template<class K >
K::Comparison_result	compare_y (const Line_2< K > &l1, const Line_2< K > &l2, const Line_2< K > &h1, const Line_2< K > &h2)
template<class K >
K::Comparison_result	compare_y (const Line_2< K > &l, const Line_2< K > &h1, const Line_2< K > &h2)
template<class K >
K::Comparison_result	compare_y_at_x (const Point_2< K > &p, const Segment_2< K > &s)
template<class K >
K::Comparison_result	compare_y_at_x (const Point_2< K > &p, const Segment_2< K > &s1, const Segment_2< K > &s2)
template<class K >
K::Comparison_result	compare_y_at_x (const Point_2< K > &p, const Line_2< K > &h)
template<class K >
K::Comparison_result	compare_y_at_x (const Point_2< K > &p, const Line_2< K > &h1, const Line_2< K > &h2)
template<class K >
K::Comparison_result	compare_y_at_x (const Line_2< K > &l1, const Line_2< K > &l2, const Line_2< K > &h)
template<class K >
K::Comparison_result	compare_y_at_x (const Line_2< K > &l1, const Line_2< K > &l2, const Line_2< K > &h1, const Line_2< K > &h2)
template<class K >
K::Comparison_result	compare_yx (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::FT	determinant (const Vector_2< K > &v0, const Vector_2< K > &v1)
template<class K >
K::Boolean	has_larger_distance_to_point (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r)
template<class K >
K::Boolean	has_smaller_distance_to_point (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r)
template<class K >
K::Boolean	has_smaller_signed_distance_to_line (const Line_2< K > &l, const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Boolean	has_larger_signed_distance_to_line (const Line_2< K > &l, const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Boolean	has_larger_signed_distance_to_line (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r, const Point_2< K > &s)
template<class K >
K::Boolean	has_smaller_signed_distance_to_line (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r, const Point_2< K > &s)
template<class K >
K::Boolean	left_turn (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r)
template<class K >
K::Boolean	less_x (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Boolean	less_y (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Boolean	lexicographically_xy_larger (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Boolean	lexicographically_xy_larger_or_equal (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Boolean	lexicographically_xy_smaller (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Boolean	lexicographically_xy_smaller_or_equal (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Boolean	lexicographically_yx_smaller (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Boolean	lexicographically_yx_smaller_or_equal (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Boolean	lexicographically_yx_larger (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Boolean	lexicographically_yx_larger_or_equal (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Point_2	midpoint (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Point_2	max_vertex (const Iso_rectangle_2< K > &ir)
template<class K >
K::Point_2	min_vertex (const Iso_rectangle_2< K > &ir)
template<class K >
K::Boolean	operator< (const Direction_2< K > &d1, const Direction_2< K > &d2)
template<class K >
K::Boolean	operator> (const Direction_2< K > &d1, const Direction_2< K > &d2)
template<class K >
K::Boolean	operator>= (const Direction_2< K > &d1, const Direction_2< K > &d2)
template<class K >
K::Boolean	operator<= (const Direction_2< K > &d1, const Direction_2< K > &d2)
template<class K >
K::Boolean	operator== (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Boolean	operator!= (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Boolean	operator< (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Boolean	operator> (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Boolean	operator<= (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Boolean	operator>= (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Boolean	operator== (const Vector_2< K > &v, const Vector_2< K > &w)
template<class K >
K::Boolean	operator!= (const Vector_2< K > &v, const Vector_2< K > &w)
template<class K >
K::Vector_2	operator* (const typename K::FT &c, const Vector_2< K > &w)
template<class K >
K::Vector_2	operator* (const Vector_2< K > &w, const typename K::FT &c)
template<class K >
K::Vector_2	operator* (const typename First_if_different< typename K::RT, typename K::FT >::Type &c, const Vector_2< K > &w)
template<class K >
K::Vector_2	operator* (const Vector_2< K > &w, const typename First_if_different< typename K::RT, typename K::FT >::Type &c)
template<class K >
K::FT	operator* (const Vector_2< K > &v, const Vector_2< K > &w)
template<class K >
K::Point_2	operator+ (const Point_2< K > &p, const Vector_2< K > &v)
template<class K >
K::Point_2	operator+ (const Origin &o, const Vector_2< K > &v)
template<class K >
K::Point_2	operator- (const Point_2< K > &p, const Vector_2< K > &v)
template<class K >
K::Point_2	operator- (const Origin &o, const Vector_2< K > &v)
template<class K >
K::Vector_2	operator- (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Vector_2	operator- (const Point_2< K > &p, const Origin &o)
template<class K >
K::Vector_2	operator- (const Origin &o, const Point_2< K > &q)
template<typename K >
K::Orientation	orientation (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r)
template<typename K >
K::Orientation	orientation (const Vector_2< K > &u, const Vector_2< K > &v)
template<class K >
K::Line_2	radical_line (const Circle_2< K > &s1, const Circle_2< K > &s2)
template<typename K >
K::Boolean	right_turn (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r)
template<class K >
K::Bounded_side	side_of_bounded_circle (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r, const Point_2< K > &t)
template<class K >
K::Bounded_side	side_of_bounded_circle (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r)
template<class K >
K::Oriented_side	side_of_oriented_circle (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r, const Point_2< K > &t)
template<class K >
K::FT	squared_radius (const Point_2< K > &p)
template<class K >
K::FT	squared_radius (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
CGAL_KERNEL_INLINE K::FT	squared_radius (const Point_2< K > &p, const Point_2< K > &q, const Point_2< K > &r)
template<class K >
K::Boolean	x_equal (const Point_2< K > &p, const Point_2< K > &q)
template<class K >
K::Boolean	y_equal (const Point_2< K > &p, const Point_2< K > &q)

---

Function Documentation

template<class K >

Angle angle	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r
	)		[inline]

Here is the call graph for this function:

Here is the caller graph for this function:

template<class K >

K::Boolean are_ordered_along_line	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r
	)		[inline]

Here is the call graph for this function:

Here is the caller graph for this function:

template<class K >

K::Boolean are_strictly_ordered_along_line	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r
	)		[inline]

Here is the call graph for this function:

Here is the caller graph for this function:

template<class K >

K::FT area	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Point_2 barycenter	(	const Point_2< K > &	p1,
		const typename K::FT &	w1,
		const Point_2< K > &	p2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Point_2 barycenter	(	const Point_2< K > &	p1,
		const typename K::FT &	w1,
		const Point_2< K > &	p2,
		const typename K::FT &	w2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Point_2 barycenter	(	const Point_2< K > &	p1,
		const typename K::FT &	w1,
		const Point_2< K > &	p2,
		const typename K::FT &	w2,
		const Point_2< K > &	p3
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Point_2 barycenter	(	const Point_2< K > &	p1,
		const typename K::FT &	w1,
		const Point_2< K > &	p2,
		const typename K::FT &	w2,
		const Point_2< K > &	p3,
		const typename K::FT &	w3
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Point_2 barycenter	(	const Point_2< K > &	p1,
		const typename K::FT &	w1,
		const Point_2< K > &	p2,
		const typename K::FT &	w2,
		const Point_2< K > &	p3,
		const typename K::FT &	w3,
		const Point_2< K > &	p4
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Point_2 barycenter	(	const Point_2< K > &	p1,
		const typename K::FT &	w1,
		const Point_2< K > &	p2,
		const typename K::FT &	w2,
		const Point_2< K > &	p3,
		const typename K::FT &	w3,
		const Point_2< K > &	p4,
		const typename K::FT &	w4
	)		[inline]

Here is the call graph for this function:

template<typename K >

K::Line_2 bisector	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

Here is the caller graph for this function:

template<typename K >

K::Line_2 bisector	(	const Line_2< K > &	l1,
		const Line_2< K > &	l2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Point_2 centroid	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Point_2 centroid

(

const Triangle_2< K > &

t

)

[inline]

Here is the call graph for this function:

template<class K >

K::Point_2 centroid	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r,
		const Point_2< K > &	s
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Point_2 circumcenter	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

Here is the caller graph for this function:

template<class K >

K::Point_2 circumcenter	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Point_2 circumcenter

(

const Triangle_2< K > &

t

)

[inline]

Here is the call graph for this function:

template<class K >

K::Boolean collinear	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Boolean collinear_are_ordered_along_line	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r
	)		[inline]

Here is the call graph for this function:

Here is the caller graph for this function:

template<class K >

K::Boolean collinear_are_strictly_ordered_along_line	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r
	)		[inline]

Here is the call graph for this function:

template<typename K >

K::Comparison_result compare_angle_with_x_axis	(	const Direction_2< K > &	d1,
		const Direction_2< K > &	d2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_distance_to_point	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_signed_distance_to_line	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r,
		const Point_2< K > &	s
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_signed_distance_to_line	(	const Line_2< K > &	l,
		const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_slopes	(	const Line_2< K > &	l1,
		const Line_2< K > &	l2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_slopes	(	const Segment_2< K > &	s1,
		const Segment_2< K > &	s2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_squared_distance	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const typename K::FT &	d2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_x	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_x	(	const Point_2< K > &	p,
		const Line_2< K > &	l1,
		const Line_2< K > &	l2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_x	(	const Line_2< K > &	l,
		const Line_2< K > &	h1,
		const Line_2< K > &	h2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_x	(	const Line_2< K > &	l1,
		const Line_2< K > &	h1,
		const Line_2< K > &	l2,
		const Line_2< K > &	h2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_x_at_y	(	const Point_2< K > &	p,
		const Line_2< K > &	h
	)		[inline]

Here is the call graph for this function:

Here is the caller graph for this function:

template<class K >

K::Comparison_result compare_x_at_y	(	const Point_2< K > &	p,
		const Line_2< K > &	h1,
		const Line_2< K > &	h2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_x_at_y	(	const Line_2< K > &	l1,
		const Line_2< K > &	l2,
		const Line_2< K > &	h
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_x_at_y	(	const Line_2< K > &	l1,
		const Line_2< K > &	l2,
		const Line_2< K > &	h1,
		const Line_2< K > &	h2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_xy	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_y	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_y	(	const Point_2< K > &	p,
		const Line_2< K > &	l1,
		const Line_2< K > &	l2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_y	(	const Line_2< K > &	l1,
		const Line_2< K > &	l2,
		const Line_2< K > &	h1,
		const Line_2< K > &	h2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_y	(	const Line_2< K > &	l,
		const Line_2< K > &	h1,
		const Line_2< K > &	h2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_y_at_x	(	const Point_2< K > &	p,
		const Segment_2< K > &	s
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_y_at_x	(	const Point_2< K > &	p,
		const Segment_2< K > &	s1,
		const Segment_2< K > &	s2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_y_at_x	(	const Point_2< K > &	p,
		const Line_2< K > &	h
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_y_at_x	(	const Point_2< K > &	p,
		const Line_2< K > &	h1,
		const Line_2< K > &	h2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_y_at_x	(	const Line_2< K > &	l1,
		const Line_2< K > &	l2,
		const Line_2< K > &	h
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_y_at_x	(	const Line_2< K > &	l1,
		const Line_2< K > &	l2,
		const Line_2< K > &	h1,
		const Line_2< K > &	h2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Comparison_result compare_yx	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

template<class K >

K::FT determinant	(	const Vector_2< K > &	v0,
		const Vector_2< K > &	v1
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Boolean has_larger_distance_to_point	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Boolean has_larger_signed_distance_to_line	(	const Line_2< K > &	l,
		const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Boolean has_larger_signed_distance_to_line	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r,
		const Point_2< K > &	s
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Boolean has_smaller_distance_to_point	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Boolean has_smaller_signed_distance_to_line	(	const Line_2< K > &	l,
		const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Boolean has_smaller_signed_distance_to_line	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r,
		const Point_2< K > &	s
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Boolean left_turn	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r
	)		[inline]

Here is the call graph for this function:

Here is the caller graph for this function:

template<class K >

K::Boolean less_x	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Boolean less_y	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Boolean lexicographically_xy_larger	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Boolean lexicographically_xy_larger_or_equal	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Boolean lexicographically_xy_smaller	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Boolean lexicographically_xy_smaller_or_equal	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Boolean lexicographically_yx_larger	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Boolean lexicographically_yx_larger_or_equal	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Boolean lexicographically_yx_smaller	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

Here is the caller graph for this function:

template<class K >

K::Boolean lexicographically_yx_smaller_or_equal	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Point_2 max_vertex

(

const Iso_rectangle_2< K > &

ir

)

[inline]

Here is the call graph for this function:

Here is the caller graph for this function:

template<class K >

K::Point_2 midpoint	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Point_2 min_vertex

(

const Iso_rectangle_2< K > &

ir

)

[inline]

Here is the call graph for this function:

Here is the caller graph for this function:

template<class K >

K::Boolean operator!=	(	const Point_2< K > &	p,
		const Origin &	o
	)

template<class K >

K::Boolean operator!=	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

template<class K >

K::Boolean operator!=	(	const Vector_2< K > &	v,
		const Vector_2< K > &	w
	)		[inline]

template<class K >

K::Vector_2 operator*	(	const typename K::FT &	c,
		const Vector_2< K > &	w
	)		[inline]

template<class K >

K::Vector_2 operator*	(	const Vector_2< K > &	w,
		const typename K::FT &	c
	)		[inline]

template<class K >

K::Vector_2 operator*	(	const typename First_if_different< typename K::RT, typename K::FT >::Type &	c,
		const Vector_2< K > &	w
	)		[inline]

template<class K >

K::Vector_2 operator*	(	const Vector_2< K > &	w,
		const typename First_if_different< typename K::RT, typename K::FT >::Type &	c
	)		[inline]

template<class K >

K::FT operator*	(	const Vector_2< K > &	v,
		const Vector_2< K > &	w
	)		[inline]

template<class K >

K::Point_2 operator+	(	const Point_2< K > &	p,
		const Vector_2< K > &	v
	)		[inline]

template<class K >

K::Point_2 operator+	(	const Origin &	o,
		const Vector_2< K > &	v
	)		[inline]

template<class K >

K::Point_2 operator-	(	const Point_2< K > &	p,
		const Vector_2< K > &	v
	)		[inline]

template<class K >

K::Point_2 operator-	(	const Origin &	o,
		const Vector_2< K > &	v
	)		[inline]

template<class K >

K::Vector_2 operator-	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

template<class K >

K::Vector_2 operator-	(	const Point_2< K > &	p,
		const Origin &	o
	)		[inline]

template<class K >

K::Vector_2 operator-	(	const Origin &	o,
		const Point_2< K > &	q
	)		[inline]

template<class K >

K::Boolean operator<	(	const Direction_2< K > &	d1,
		const Direction_2< K > &	d2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Boolean operator<	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

template<class K >

K::Boolean operator<=	(	const Direction_2< K > &	d1,
		const Direction_2< K > &	d2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Boolean operator<=	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

template<class K >

CGAL_BEGIN_NAMESPACE K::Boolean operator==	(	const Point_2< K > &	p,
		const Origin &	o
	)

template<class K >

K::Boolean operator==	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

template<class K >

K::Boolean operator==	(	const Vector_2< K > &	v,
		const Vector_2< K > &	w
	)		[inline]

template<class K >

K::Boolean operator>	(	const Direction_2< K > &	d1,
		const Direction_2< K > &	d2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Boolean operator>	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

template<class K >

K::Boolean operator>=	(	const Direction_2< K > &	d1,
		const Direction_2< K > &	d2
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Boolean operator>=	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

template<typename K >

K::Orientation orientation	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r
	)		[inline]

Here is the call graph for this function:

template<typename K >

K::Orientation orientation	(	const Vector_2< K > &	u,
		const Vector_2< K > &	v
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Line_2 radical_line	(	const Circle_2< K > &	s1,
		const Circle_2< K > &	s2
	)		[inline]

template<typename K >

K::Boolean right_turn	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r
	)		[inline]

Here is the call graph for this function:

Here is the caller graph for this function:

template<class K >

K::Bounded_side side_of_bounded_circle	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r,
		const Point_2< K > &	t
	)		[inline]

Here is the call graph for this function:

Here is the caller graph for this function:

template<class K >

K::Bounded_side side_of_bounded_circle	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r
	)		[inline]

Here is the call graph for this function:

template<class K >

K::Oriented_side side_of_oriented_circle	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r,
		const Point_2< K > &	t
	)		[inline]

Here is the call graph for this function:

Here is the caller graph for this function:

template<class K >

K::FT squared_radius

(

const Point_2< K > &

p

)

[inline]

Here is the call graph for this function:

Here is the caller graph for this function:

template<class K >

K::FT squared_radius	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

template<class K >

CGAL_KERNEL_INLINE K::FT squared_radius	(	const Point_2< K > &	p,
		const Point_2< K > &	q,
		const Point_2< K > &	r
	)

Here is the call graph for this function:

template<class K >

K::Boolean x_equal	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

Here is the caller graph for this function:

template<class K >

K::Boolean y_equal	(	const Point_2< K > &	p,
		const Point_2< K > &	q
	)		[inline]

Here is the call graph for this function:

Here is the caller graph for this function: