SPAR/AIModule/BWTA/vendors/CGAL/CGAL/global_functions_circular_kernel_2.h File Reference

#include <CGAL/Circular_arc_2.h>
#include <CGAL/Circular_arc_point_2.h>
#include <CGAL/Line_arc_2.h>
#include <CGAL/Circular_kernel_2/internal_functions_on_circle_2.h>

Include dependency graph for global_functions_circular_kernel_2.h:

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

Go to the source code of this file.

Functions
template<class CK >
CGAL_BEGIN_NAMESPACE Circular_arc_point_2< CK >	x_extremal_point (const Circle_2< CK > &c, bool i)
template<class CK , class OutputIterator >
OutputIterator	x_extremal_points (const Circle_2< CK > &c, OutputIterator res)
template<class CK >
Circular_arc_point_2< CK >	y_extremal_point (const Circle_2< CK > &c, bool i)
template<class CK , class OutputIterator >
OutputIterator	y_extremal_points (const Circle_2< CK > &c, OutputIterator res)
template<class CK >
CGAL::Comparison_result	compare_x (const Circular_arc_2< CK > &A1, const bool b1, const Circular_arc_2< CK > &A2, const bool b2)
template<class CK >
CGAL::Comparison_result	compare_x (const Circular_arc_point_2< CK > &p, const Circular_arc_point_2< CK > &q)
template<class CK >
CGAL::Comparison_result	compare_y (const Circular_arc_point_2< CK > &p, const Circular_arc_point_2< CK > &q)
template<class CK >
CGAL::Comparison_result	compare_xy (const Circular_arc_point_2< CK > &p, const Circular_arc_point_2< CK > &q)
template<class CK >
CGAL::Comparison_result	compare_y_to_right (const Circular_arc_2< CK > &A1, const Circular_arc_2< CK > &A2, const Circular_arc_point_2< CK > &p)
template<class CK >
bool	has_in_x_range (const Circular_arc_2< CK > &A, const Circular_arc_point_2< CK > &p)
template<class CK >
CGAL::Comparison_result	compare_y_at_x (const Circular_arc_point_2< CK > &p, const Circular_arc_2< CK > &a)
template<class CK , class OutputIterator >
OutputIterator	make_x_monotone (const Circular_arc_2< CK > &A, OutputIterator it)
template<class CK , class OutputIterator >
OutputIterator	make_xy_monotone (const Circular_arc_2< CK > &A, OutputIterator it)
template<class CK >
bool	has_on (const Circle_2< CK > &c, const Circular_arc_point_2< CK > &p)
template<class CK >
CGAL::Comparison_result	compare_y_to_right (const Line_arc_2< CK > &A1, const Line_arc_2< CK > &A2, const Circular_arc_point_2< CK > &p)
template<class CK >
bool	has_in_x_range (const Line_arc_2< CK > &A, const Circular_arc_point_2< CK > &p)
template<class CK >
CGAL::Comparison_result	compare_y_at_x (const Circular_arc_point_2< CK > &p, const Line_arc_2< CK > &a)
template<class CK , class OutputIterator >
OutputIterator	make_x_monotone (const Line_arc_2< CK > &A, OutputIterator it)
template<class CK , class OutputIterator >
OutputIterator	make_xy_monotone (const Line_arc_2< CK > &A, OutputIterator it)

---

Function Documentation

template<class CK >

CGAL::Comparison_result compare_x	(	const Circular_arc_2< CK > &	A1,
		const bool	b1,
		const Circular_arc_2< CK > &	A2,
		const bool	b2
	)		[inline]

template<class CK >

CGAL::Comparison_result compare_x	(	const Circular_arc_point_2< CK > &	p,
		const Circular_arc_point_2< CK > &	q
	)		[inline]

template<class CK >

CGAL::Comparison_result compare_xy	(	const Circular_arc_point_2< CK > &	p,
		const Circular_arc_point_2< CK > &	q
	)		[inline]

template<class CK >

CGAL::Comparison_result compare_y	(	const Circular_arc_point_2< CK > &	p,
		const Circular_arc_point_2< CK > &	q
	)		[inline]

template<class CK >

CGAL::Comparison_result compare_y_at_x	(	const Circular_arc_point_2< CK > &	p,
		const Circular_arc_2< CK > &	a
	)

template<class CK >

CGAL::Comparison_result compare_y_at_x	(	const Circular_arc_point_2< CK > &	p,
		const Line_arc_2< CK > &	a
	)

template<class CK >

CGAL::Comparison_result compare_y_to_right	(	const Circular_arc_2< CK > &	A1,
		const Circular_arc_2< CK > &	A2,
		const Circular_arc_point_2< CK > &	p
	)		[inline]

template<class CK >

CGAL::Comparison_result compare_y_to_right	(	const Line_arc_2< CK > &	A1,
		const Line_arc_2< CK > &	A2,
		const Circular_arc_point_2< CK > &	p
	)		[inline]

template<class CK >

bool has_in_x_range	(	const Circular_arc_2< CK > &	A,
		const Circular_arc_point_2< CK > &	p
	)		[inline]

template<class CK >

bool has_in_x_range	(	const Line_arc_2< CK > &	A,
		const Circular_arc_point_2< CK > &	p
	)		[inline]

template<class CK >

bool has_on	(	const Circle_2< CK > &	c,
		const Circular_arc_point_2< CK > &	p
	)		[inline]

Here is the caller graph for this function:

template<class CK , class OutputIterator >

OutputIterator make_x_monotone	(	const Circular_arc_2< CK > &	A,
		OutputIterator	it
	)

template<class CK , class OutputIterator >

OutputIterator make_x_monotone	(	const Line_arc_2< CK > &	A,
		OutputIterator	it
	)

template<class CK , class OutputIterator >

OutputIterator make_xy_monotone	(	const Circular_arc_2< CK > &	A,
		OutputIterator	it
	)

template<class CK , class OutputIterator >

OutputIterator make_xy_monotone	(	const Line_arc_2< CK > &	A,
		OutputIterator	it
	)

template<class CK >

CGAL_BEGIN_NAMESPACE Circular_arc_point_2<CK> x_extremal_point	(	const Circle_2< CK > &	c,
		bool	i
	)

template<class CK , class OutputIterator >

OutputIterator x_extremal_points	(	const Circle_2< CK > &	c,
		OutputIterator	res
	)

Here is the call graph for this function:

template<class CK >

Circular_arc_point_2<CK> y_extremal_point	(	const Circle_2< CK > &	c,
		bool	i
	)

template<class CK , class OutputIterator >

OutputIterator y_extremal_points	(	const Circle_2< CK > &	c,
		OutputIterator	res
	)

Here is the call graph for this function: