mirror of https://github.com/CGAL/cgal
161 lines
3.6 KiB
C++
161 lines
3.6 KiB
C++
// Copyright (c) 2000 Utrecht University (The Netherlands),
|
|
// ETH Zurich (Switzerland), Freie Universitaet Berlin (Germany),
|
|
// INRIA Sophia-Antipolis (France), Martin-Luther-University Halle-Wittenberg
|
|
// (Germany), Max-Planck-Institute Saarbruecken (Germany), RISC Linz (Austria),
|
|
// and Tel-Aviv University (Israel). All rights reserved.
|
|
//
|
|
// This file is part of CGAL (www.cgal.org); you can redistribute it and/or
|
|
// modify it under the terms of the GNU Lesser General Public License as
|
|
// published by the Free Software Foundation; version 2.1 of the License.
|
|
// See the file LICENSE.LGPL distributed with CGAL.
|
|
//
|
|
// Licensees holding a valid commercial license may use this file in
|
|
// accordance with the commercial license agreement provided with the software.
|
|
//
|
|
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
|
|
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
|
//
|
|
// $URL$
|
|
// $Id$
|
|
//
|
|
//
|
|
// Author(s) : Andreas Fabri and Herve Bronnimann
|
|
|
|
#ifndef CGAL_CARTESIAN_POINT_3_H
|
|
#define CGAL_CARTESIAN_POINT_3_H
|
|
|
|
#include <CGAL/array.h>
|
|
#include <CGAL/Handle_for.h>
|
|
#include <CGAL/Origin.h>
|
|
#include <CGAL/constant.h>
|
|
|
|
CGAL_BEGIN_NAMESPACE
|
|
|
|
template < class R_ >
|
|
class PointC3
|
|
{
|
|
typedef typename R_::FT FT;
|
|
typedef typename R_::Vector_3 Vector_3;
|
|
typedef typename R_::Point_3 Point_3;
|
|
typedef typename R_::Aff_transformation_3 Aff_transformation_3;
|
|
|
|
typedef boost::array<FT, 3> Rep;
|
|
typedef typename R_::template Handle<Rep>::type Base;
|
|
|
|
Base base;
|
|
|
|
public:
|
|
typedef typename Rep::const_iterator Cartesian_const_iterator;
|
|
typedef R_ R;
|
|
|
|
PointC3() {}
|
|
|
|
PointC3(const Origin &)
|
|
: base(CGALi::make_array(FT(0), FT(0), FT(0))) {}
|
|
|
|
PointC3(const FT &x, const FT &y, const FT &z)
|
|
: base(CGALi::make_array(x, y, z)) {}
|
|
|
|
PointC3(const FT &x, const FT &y, const FT &z, const FT &w)
|
|
: base( w != FT(1) ? CGALi::make_array(x/w, y/w, z/w)
|
|
: CGALi::make_array(x, y, z) ) {}
|
|
|
|
/*
|
|
bool operator==(const PointC3 &p) const
|
|
{
|
|
if (CGAL::identical(base, p.base))
|
|
return true;
|
|
return x_equal(*this, p) && y_equal(*this, p) && z_equal(*this, p);
|
|
}
|
|
bool operator!=(const PointC3 &p) const
|
|
{
|
|
return !(*this == p);
|
|
}
|
|
*/
|
|
|
|
const FT & x() const
|
|
{
|
|
return get(base)[0];
|
|
}
|
|
const FT & y() const
|
|
{
|
|
return get(base)[1];
|
|
}
|
|
const FT & z() const
|
|
{
|
|
return get(base)[2];
|
|
}
|
|
|
|
const FT & hx() const
|
|
{
|
|
return x();
|
|
}
|
|
const FT & hy() const
|
|
{
|
|
return y();
|
|
}
|
|
const FT & hz() const
|
|
{
|
|
return z();
|
|
}
|
|
const FT & hw() const
|
|
{
|
|
return constant<FT, 1>();
|
|
}
|
|
|
|
const FT & cartesian(int i) const;
|
|
const FT & operator[](int i) const;
|
|
const FT & homogeneous(int i) const;
|
|
|
|
Cartesian_const_iterator cartesian_begin() const
|
|
{
|
|
return get(base).begin();
|
|
}
|
|
|
|
Cartesian_const_iterator cartesian_end() const
|
|
{
|
|
return get(base).end();
|
|
}
|
|
|
|
int dimension() const
|
|
{
|
|
return 3;
|
|
}
|
|
|
|
Point_3 transform(const Aff_transformation_3 &t) const
|
|
{
|
|
return t.transform(*this);
|
|
}
|
|
};
|
|
|
|
template < class R >
|
|
inline
|
|
const typename PointC3<R>::FT &
|
|
PointC3<R>::cartesian(int i) const
|
|
{
|
|
CGAL_kernel_precondition( (i>=0) && (i<=2) );
|
|
return get(base)[i];
|
|
}
|
|
|
|
template < class R >
|
|
inline
|
|
const typename PointC3<R>::FT &
|
|
PointC3<R>::operator[](int i) const
|
|
{
|
|
return cartesian(i);
|
|
}
|
|
|
|
template < class R >
|
|
inline
|
|
const typename PointC3<R>::FT &
|
|
PointC3<R>::homogeneous(int i) const
|
|
{
|
|
CGAL_kernel_precondition(i>=0 && i<=3);
|
|
if (i<3) return cartesian(i);
|
|
return hw();
|
|
}
|
|
|
|
CGAL_END_NAMESPACE
|
|
|
|
#endif // CGAL_CARTESIAN_POINT_3_H
|