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

#include <CGAL/basic.h>
#include <CGAL/enum.h>

Include dependency graph for predicates_d.h:

Go to the source code of this file.

Functions
template<class R , class ForwardIterator , class OutputIterator >
CGAL_BEGIN_NAMESPACE OutputIterator	barycentric_coordinates (ForwardIterator first, ForwardIterator last, const Point_d< R > &p, OutputIterator result)
template<class ForwardIterator >
Orientation	orientation (ForwardIterator first, ForwardIterator last)
template<class R , class ForwardIterator >
Oriented_side	side_of_oriented_sphere (ForwardIterator first, ForwardIterator last, const Point_d< R > &x)
template<class R , class ForwardIterator >
Bounded_side	side_of_bounded_sphere (ForwardIterator first, ForwardIterator last, const Point_d< R > &p)
template<class R , class ForwardIterator >
bool	contained_in_simplex (ForwardIterator first, ForwardIterator last, const Point_d< R > &p)
template<class R , class ForwardIterator >
bool	contained_in_affine_hull (ForwardIterator first, ForwardIterator last, const Point_d< R > &p)
template<class ForwardIterator >
int	affine_rank (ForwardIterator first, ForwardIterator last)
template<class ForwardIterator >
bool	affinely_independent (ForwardIterator first, ForwardIterator last)
template<class R >
Comparison_result	compare_lexicographically (const Point_d< R > &p1, const Point_d< R > &p2)
template<class R >
bool	lexicographically_smaller (const Point_d< R > &p1, const Point_d< R > &p2)
template<class R >
bool	lexicographically_smaller_or_equal (const Point_d< R > &p1, const Point_d< R > &p2)
template<class R , class ForwardIterator >
bool	contained_in_linear_hull (ForwardIterator first, ForwardIterator last, const Vector_d< R > &x)
template<class ForwardIterator >
int	linear_rank (ForwardIterator first, ForwardIterator last)
template<class ForwardIterator >
bool	linearly_independent (ForwardIterator first, ForwardIterator last)

---

Function Documentation

template<class ForwardIterator >

int affine_rank	(	ForwardIterator	first,
		ForwardIterator	last
	)

Here is the call graph for this function:

Here is the caller graph for this function:

template<class ForwardIterator >

bool affinely_independent	(	ForwardIterator	first,
		ForwardIterator	last
	)

Here is the call graph for this function:

Here is the caller graph for this function:

template<class R , class ForwardIterator , class OutputIterator >

CGAL_BEGIN_NAMESPACE OutputIterator barycentric_coordinates	(	ForwardIterator	first,
		ForwardIterator	last,
		const Point_d< R > &	p,
		OutputIterator	result
	)

template<class R >

Comparison_result compare_lexicographically	(	const Point_d< R > &	p1,
		const Point_d< R > &	p2
	)

Here is the call graph for this function:

template<class R , class ForwardIterator >

bool contained_in_affine_hull	(	ForwardIterator	first,
		ForwardIterator	last,
		const Point_d< R > &	p
	)

Here is the caller graph for this function:

template<class R , class ForwardIterator >

bool contained_in_linear_hull	(	ForwardIterator	first,
		ForwardIterator	last,
		const Vector_d< R > &	x
	)

template<class R , class ForwardIterator >

bool contained_in_simplex	(	ForwardIterator	first,
		ForwardIterator	last,
		const Point_d< R > &	p
	)

Here is the caller graph for this function:

template<class R >

bool lexicographically_smaller	(	const Point_d< R > &	p1,
		const Point_d< R > &	p2
	)

template<class R >

bool lexicographically_smaller_or_equal	(	const Point_d< R > &	p1,
		const Point_d< R > &	p2
	)

template<class ForwardIterator >

int linear_rank	(	ForwardIterator	first,
		ForwardIterator	last
	)

Here is the call graph for this function:

Here is the caller graph for this function:

template<class ForwardIterator >

bool linearly_independent	(	ForwardIterator	first,
		ForwardIterator	last
	)

Here is the call graph for this function:

template<class ForwardIterator >

Orientation orientation	(	ForwardIterator	first,
		ForwardIterator	last
	)

Here is the call graph for this function:

template<class R , class ForwardIterator >

Bounded_side side_of_bounded_sphere	(	ForwardIterator	first,
		ForwardIterator	last,
		const Point_d< R > &	p
	)

template<class R , class ForwardIterator >

Oriented_side side_of_oriented_sphere	(	ForwardIterator	first,
		ForwardIterator	last,
		const Point_d< R > &	x
	)