point_vector_definitions_2.C

Go to the documentation of this file.

// ======================================================================
//
// Copyright (c) 1999 The CGAL Consortium

// This software and related documentation is part of the Computational
// Geometry Algorithms Library (CGAL).
// This software and documentation is provided "as-is" and without warranty
// of any kind. In no event shall the CGAL Consortium be liable for any
// damage of any kind. 
//
// Every use of CGAL requires a license. 
//
// Academic research and teaching license
// - For academic research and teaching purposes, permission to use and copy
//   the software and its documentation is hereby granted free of charge,
//   provided that it is not a component of a commercial product, and this
//   notice appears in all copies of the software and related documentation. 
//
// Commercial licenses
// - A commercial license is available through Algorithmic Solutions, who also
//   markets LEDA (http://www.algorithmic-solutions.de). 
// - Commercial users may apply for an evaluation license by writing to
//   Algorithmic Solutions (contact@algorithmic-solutions.com). 
//
// The CGAL Consortium consists of Utrecht University (The Netherlands),
// ETH Zurich (Switzerland), Free University of Berlin (Germany),
// INRIA Sophia-Antipolis (France), Martin-Luther-University Halle-Wittenberg
// (Germany), Max-Planck-Institute Saarbrucken (Germany), RISC Linz (Austria),
// and Tel-Aviv University (Israel).
//
// ----------------------------------------------------------------------
// 
// release       : CGAL-2.2
// release_date  : 2000, September 30
// 
// source        : PV_decl.fw
// file          : include/CGAL/point_vector_definitions_2.C
// package       : _2 (3.6)
// revision      : 3.6
// revision_date : 30 Jul 2000 
// author(s)     : Stefan Schirra
//
//
// coordinator   : MPI, Saarbruecken  (<Stefan.Schirra>)
// email         : contact@cgal.org
// www           : http://www.cgal.org
//
// ======================================================================
 

#ifndef CGAL_POINT_VECTOR_DEFINITIONS_2_C
#define CGAL_POINT_VECTOR_DEFINITIONS_2_C

CGAL_BEGIN_NAMESPACE

template < class R >
inline
Vector_2<R>
point_to_vector_conversion(const Point_2<R>& p)
{ return Vector_2<R>(p); }

template < class R >
inline
Point_2<R>
vector_to_point_conversion(const Vector_2<R>& v)
{ return Point_2<R>(v); }

template < class R >
inline
Point_2<R>
operator+(const Point_2<R>& p, const Vector_2<R>& v)
{
  typedef typename  R::Point_2_base  RPoint_2;
  typedef typename  R::Vector_2_base  RVector_2;
  return Point_2<R>((const RPoint_2& )p + (const RVector_2& )v) ;
}

template < class R >
inline
Point_2<R>
operator-(const Point_2<R>& p, const Vector_2<R>& v)
{
  typedef typename  R::Point_2_base  RPoint_2;
  typedef typename  R::Vector_2_base  RVector_2;
  return Point_2<R>((const RPoint_2& )p - (const RVector_2& )v) ;
}

template < class R >
inline
Point_2<R>
operator+(const Origin& , const Vector_2<R>& v)
{ return vector_to_point_conversion(v) ; }

template < class R >
inline
Point_2<R>
operator-(const Origin& , const Vector_2<R>& v)
{ return vector_to_point_conversion(-v) ; }

template < class R >
inline
Vector_2<R>
operator-(const Point_2<R>& p, const Point_2<R>& q)
{
  typedef typename  R::Point_2_base  RPoint_2;
  return Vector_2<R>((const RPoint_2& )p - (const RPoint_2& )q) ;
}

template < class R >
inline
Vector_2<R>
operator-(const Point_2<R>& p, const Origin& )
{ return point_to_vector_conversion(p) ; }

template < class R >
inline
Vector_2<R>
operator-(const Origin& , const Point_2<R>& p)
{
  typedef typename  R::Point_2_base  RPoint_2;
  return Vector_2<R>(ORIGIN - (const RPoint_2& )p) ;
}

CGAL_END_NAMESPACE


#endif // CGAL_POINT_VECTOR_DEFINITIONS_2_C