global_functions_2.h

很多二维 三维几何计算算法 C++ 类库

compare_yx(const Point_2<K> &p, const Point_2<K> &q)
{
  return CGALi::compare_yx(p, q, K());
}

template < class K >
inline
typename K::FT
determinant(const Vector_2<K> &v0, const Vector_2<K> &v1)
{
  return CGALi::determinant(v0, v1, K());
}

template <class K>
inline
bool
has_larger_distance_to_point(const Point_2<K>& p,
			     const Point_2<K>& q,
			     const Point_2<K>& r)
{
  return CGALi::has_larger_distance_to_point(p, q, r, K());
}

template <class K>
inline
bool
has_smaller_distance_to_point(const Point_2<K>& p,
                              const Point_2<K>& q,
                              const Point_2<K>& r)
{
  return CGALi::has_smaller_distance_to_point(p, q, r, K());
}

template <class K>
inline
bool
has_smaller_signed_distance_to_line(const Line_2<K>& l,
                                    const Point_2<K>& p,
                                    const Point_2<K>& q)
{
  return CGALi::has_smaller_signed_distance_to_line(l, p, q, K());
}

template <class K>
inline
bool
has_larger_signed_distance_to_line(const Line_2<K>& l,
				   const Point_2<K>& p,
				   const Point_2<K>& q)
{
  return CGALi::has_larger_signed_distance_to_line(l, p, q, K());
}

template <class K>
inline
bool
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)
{
  return CGALi::has_larger_signed_distance_to_line(p, q, r, s, K());
}

template <class K>
inline
bool
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)
{
  return CGALi::has_smaller_signed_distance_to_line(p, q, r, s, K());
}

template < class K >
inline
bool
left_turn(const Point_2<K> &p, const Point_2<K> &q, const Point_2<K> &r)
{
  return CGALi::left_turn(p, q, r, K());
}

template < class K >
inline
bool
less_x(const Point_2<K> &p, const Point_2<K> &q)
{
  return CGALi::less_x(p, q, K());
}

template < class K >
inline
bool
less_y(const Point_2<K> &p, const Point_2<K> &q)
{
  return CGALi::less_y(p, q, K());
}

template < class K >
inline
bool
lexicographically_xy_larger(const Point_2<K> &p, const Point_2<K> &q)
{
  return CGALi::lexicographically_xy_larger(p, q, K());
}

template < class K >
inline
bool
lexicographically_xy_larger_or_equal(const Point_2<K> &p, const Point_2<K> &q)
{
  return CGALi::lexicographically_xy_larger_or_equal(p, q, K());
}

template < class K >
inline
bool
lexicographically_xy_smaller(const Point_2<K> &p, const Point_2<K> &q)
{
  return CGALi::lexicographically_xy_smaller(p, q, K());
}

template < class K >
inline
bool
lexicographically_xy_smaller_or_equal(const Point_2<K> &p,
                                      const Point_2<K> &q)
{
  return CGALi::lexicographically_xy_smaller_or_equal(p, q, K());
}

template < class K >
inline
bool
lexicographically_yx_smaller(const Point_2<K> &p, const Point_2<K> &q)
{
  return CGALi::lexicographically_yx_smaller(p, q, K());
}

template < class K >
inline
bool
lexicographically_yx_smaller_or_equal(const Point_2<K> &p, const Point_2<K> &q)
{
  return CGALi::lexicographically_yx_smaller_or_equal(p, q, K());
}

// FIXME : Undocumented
template < class K >
inline
bool
lexicographically_yx_larger(const Point_2<K> &p, const Point_2<K> &q)
{
  return CGALi::lexicographically_yx_larger(p, q, K());
}

// FIXME : Undocumented
template < class K >
inline
bool
lexicographically_yx_larger_or_equal(const Point_2<K> &p, const Point_2<K> &q)
{
  return CGALi::lexicographically_yx_larger_or_equal(p, q, K());
}

template < class K >
inline
typename K::Point_2
midpoint(const Point_2<K> &p, const Point_2<K> &q)
{
  return CGALi::midpoint(p, q, K());
}

template < class K >
inline
typename K::Point_2
max_vertex(const Iso_rectangle_2<K> &ir)
{
  return CGALi::max_vertex(ir, K());
}

template < class K >
inline
typename K::Point_2
min_vertex(const Iso_rectangle_2<K> &ir)
{
  return CGALi::min_vertex(ir, K());
}

// FIXME TODO : What do we do with the operators ?
// They have no counter part with the kernel argument...
template < class K >
inline
bool
operator<(const Direction_2<K>& d1, const Direction_2<K>& d2)
{ return compare_angle_with_x_axis(d1, d2) == SMALLER; }

template < class K >
inline
bool
operator>(const Direction_2<K>& d1, const Direction_2<K>& d2)
{ return compare_angle_with_x_axis(d1, d2) == LARGER; }

template < class K >
inline
bool
operator>=(const Direction_2<K>& d1, const Direction_2<K>& d2)
{ return compare_angle_with_x_axis(d1, d2) != SMALLER; }

template < class K >
inline
bool
operator<=(const Direction_2<K>& d1, const Direction_2<K>& d2)
{ return compare_angle_with_x_axis(d1, d2) != LARGER; }

template < class K >
inline
bool
operator==(const Point_2<K>& p, const Point_2<K>& q)
{ return K().equal_2_object()(p, q); }

template < class K >
inline
bool
operator!=(const Point_2<K>& p, const Point_2<K>& q)
{ return ! (p == q); }

template < class K >
inline
bool
operator<(const Point_2<K>& p, const Point_2<K>& q)
{ return K().less_xy_2_object()(p, q); }

template < class K >
inline
bool
operator>(const Point_2<K>& p, const Point_2<K>& q)
{ return K().less_xy_2_object()(q, p); }

template < class K >
inline
bool
operator<=(const Point_2<K>& p, const Point_2<K>& q)
{ return ! K().less_xy_2_object()(q, p); }

template < class K >
inline
bool
operator>=(const Point_2<K>& p, const Point_2<K>& q)
{ return ! K().less_xy_2_object()(p, q); }

template < class K >
inline
bool
operator==(const Vector_2<K>& v, const Vector_2<K>& w)
{ return K().equal_2_object()(v, w); }

template < class K >
inline
bool
operator!=(const Vector_2<K>& v, const Vector_2<K>& w)
{ return ! (v == w); }

template < class K >
inline
typename K::Vector_2
operator*(const typename CGAL_WRAP(K)::FT &c, const Vector_2<K> &w)
{
  return K().construct_scaled_vector_2_object()(w, c);
}

template < class K >
inline
typename K::Vector_2
operator*(const Vector_2<K> &w, const typename CGAL_WRAP(K)::FT &c)
{
  return K().construct_scaled_vector_2_object()(w, c);
}

template < class K >
inline
typename K::Vector_2
operator*(const typename First_if_different<typename K::RT,
                                            typename K::FT>::Type &c,
          const Vector_2<K> &w)
{
  return K().construct_scaled_vector_2_object()(w, c);
}

template < class K >
inline
typename K::Vector_2
operator*(const Vector_2<K> &w,
          const typename First_if_different<typename K::RT,
                                            typename K::FT>::Type &c)
{
  return K().construct_scaled_vector_2_object()(w, c);
}

template < class K >
inline
typename K::FT
operator*(const Vector_2<K> &v, const Vector_2<K> &w)
{
  return K().compute_scalar_product_2_object()(v, w);
}

template < class K >
inline
typename K::Point_2
operator+(const Point_2<K> &p, const Vector_2<K> &v)
{
  return K().construct_translated_point_2_object()(p, v);
}

template < class K >
inline
typename K::Point_2
operator+(const Origin &o, const Vector_2<K> &v)
{
  return K().construct_translated_point_2_object()(o, v);
}

template < class K >
inline
typename K::Point_2
operator-(const Point_2<K> &p, const Vector_2<K> &v)
{
  return K().construct_translated_point_2_object()
                (p, K().construct_opposite_vector_2_object()(v));
}

template < class K >
inline
typename K::Point_2
operator-(const Origin &o, const Vector_2<K> &v)
{
  return K().construct_translated_point_2_object()
               (o, K().construct_opposite_vector_2_object()(v));
}

template < class K >
inline
typename K::Vector_2
operator-(const Point_2<K> &p, const Point_2<K> &q)
{
  return K().construct_vector_2_object()(q, p);
}

template < class K >
inline
typename K::Vector_2
operator-(const Point_2<K> &p, const Origin &o)
{
  return K().construct_vector_2_object()(o, p);
}

template < class K >
inline
typename K::Vector_2
operator-(const Origin &o, const Point_2<K> &q)
{
  return K().construct_vector_2_object()(q, o);
}

template <typename K>
inline
Orientation
orientation(const Point_2<K> &p, const Point_2<K> &q, const Point_2<K> &r)
{
  return CGALi::orientation(p, q, r, K());
}

template <typename K>
inline
Orientation
orientation(const Vector_2<K> &u, const Vector_2<K> &v)
{
  return CGALi::orientation(u, v, K());
}

// parallel() functions are in global_functions.h

template <typename K>
inline
bool
right_turn(const Point_2<K> &p, const Point_2<K> &q, const Point_2<K> &r)
{
  return CGALi::right_turn(p, q, r, K());
}

template <class K>
inline
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)
{
  return CGALi::side_of_bounded_circle(p, q, r, t, K());
}

template <class K>
inline
Bounded_side
side_of_bounded_circle(const Point_2<K> &p,
                       const Point_2<K> &q,
                       const Point_2<K> &r)
{
  return CGALi::side_of_bounded_circle(p, q, r, K());
}

template <class K>
inline
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)
{
  return CGALi::side_of_oriented_circle(p, q, r, t, K());
}

template < class K >
inline
typename K::FT
squared_radius(const Point_2<K> &p, const Point_2<K> &q)
{
  return CGALi::squared_radius(p, q, K());
}

template < class K >
CGAL_KERNEL_INLINE
typename K::FT
squared_radius(const Point_2<K>& p, const Point_2<K>& q, const Point_2<K>& r)
{
  return CGALi::squared_radius(p, q, r, K());
}

template < class K >
inline
bool
x_equal(const Point_2<K> &p, const Point_2<K> &q)
{
  return CGALi::x_equal(p, q, K());
}

template < class K >
inline
bool
y_equal(const Point_2<K> &p, const Point_2<K> &q)
{
  return CGALi::y_equal(p, q, K());
}

CGAL_END_NAMESPACE

#endif  // CGAL_KERNEL_GLOBAL_FUNCTIONS_2_H