// ====================================================================== // // Copyright (c) 2000 The CGAL Consortium // // This software and related documentation is part of an INTERNAL release // of the Computational Geometry Algorithms Library (CGAL). It is not // intended for general use. // // ---------------------------------------------------------------------- // // release : // release_date : // // file : include/CGAL/Cartesian/Tetrahedron_d.h // revision : $Revision$ // revision_date : $Date$ // author(s) : Herve.Bronnimann@sophia.inria.fr // coordinator : INRIA Sophia-Antipolis (Mariette.Yvinec@sophia.inria.fr) // // ====================================================================== #ifndef CGAL_CARTESIAN_TETRAHEDRON_D_H #define CGAL_CARTESIAN_TETRAHEDRON_D_H #include #include CGAL_BEGIN_NAMESPACE template class TetrahedronCd CGAL_ADVANCED_KERNEL_PARTIAL_SPEC : public Handle { public: typedef R_ R; typedef typename R::FT FT; typedef typename R::RT RT; #ifndef CGAL_CFG_NO_ADVANCED_KERNEL typedef TetrahedronCd Self; typedef typename R::Point_d Point_d; typedef typename R::Plane_d Plane_d; typedef typename R::Aff_transformation_d Aff_transformation_d; #else typedef TetrahedronCd Self; typedef typename R::Point_d_base Point_d; typedef typename R::Plane_d_base Plane_d; typedef typename R::Aff_transformation_d_base Aff_transformation_d; #endif TetrahedronCd(); TetrahedronCd(const Self &t); TetrahedronCd(const Point_d &p, const Point_d &q, const Point_d &r, const Point_d &s); ~TetrahedronCd(); Self &operator=(const Self &t); Point_d vertex(int i) const; Point_d operator[](int i) const; bool operator==(const Self &t) const; bool operator!=(const Self &t) const; long id() const; int dimension() const; // Bbox_d bbox() const; Self transform(const Aff_transformation_d &t) const; // Only makes sense for 3D Orientation orientation() const; Oriented_side oriented_side(const Point_d &p) const; Bounded_side bounded_side(const Point_d &p) const; bool has_on_positive_side(const Point_d &p) const; bool has_on_negative_side(const Point_d &p) const; bool has_on_bounded_side(const Point_d &p) const; bool has_on_unbounded_side(const Point_d &p) const; bool has_on_boundary(const Point_d &p) const; bool has_on(const Point_d &p) const; // Makes sense for any dimension, but only implemented in 3D bool is_degenerate() const; // End of 3D section private: _Fourtuple< Point_d >* ptr() const; }; CGAL_END_NAMESPACE #ifndef CGAL_CARTESIAN_CLASS_DEFINED #include #endif #endif