// ====================================================================== // // 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/Segment_2.h // revision : $Revision$ // revision_date : $Date$ // author(s) : Andreas Fabri, Herve Bronnimann // coordinator : INRIA Sophia-Antipolis (Mariette.Yvinec@sophia.inria.fr) // // ====================================================================== #ifndef CGAL_CARTESIAN_SEGMENT_2_H #define CGAL_CARTESIAN_SEGMENT_2_H #include #include CGAL_BEGIN_NAMESPACE template < class R_ > class SegmentC2 CGAL_ADVANCED_KERNEL_PARTIAL_SPEC : public Handle_for< Twotuple< typename R_::Point_2> > { public: typedef R_ R; typedef typename R::FT FT; typedef typename R::RT RT; #ifndef CGAL_CFG_NO_ADVANCED_KERNEL typedef SegmentC2 Self; typedef typename R::Point_2 Point_2; typedef typename R::Vector_2 Vector_2; typedef typename R::Direction_2 Direction_2; typedef typename R::Line_2 Line_2; typedef typename R::Ray_2 Ray_2; typedef typename R::Triangle_2 Triangle_2; typedef typename R::Iso_rectangle_2 Iso_rectangle_2; typedef typename R::Aff_transformation_2 Aff_transformation_2; typedef typename R::Circle_2 Circle_2; #else typedef SegmentC2 Self; typedef typename R::Point_2_base Point_2; typedef typename R::Vector_2_base Vector_2; typedef typename R::Direction_2_base Direction_2; typedef typename R::Line_2_base Line_2; typedef typename R::Ray_2_base Ray_2; typedef typename R::Triangle_2_base Triangle_2; typedef typename R::Iso_rectangle_2_base Iso_rectangle_2; typedef typename R::Aff_transformation_2_base Aff_transformation_2; typedef typename R::Circle_2_base Circle_2; #endif SegmentC2(); SegmentC2(const Self &s); SegmentC2(const Point_2 &sp, const Point_2 &ep); ~SegmentC2(); bool is_horizontal() const; bool is_vertical() const; bool has_on(const Point_2 &p) const; bool collinear_has_on(const Point_2 &p) const; bool operator==(const Self &s) const; bool operator!=(const Self &s) const; Point_2 start() const; Point_2 end() const; Point_2 source() const; Point_2 target() const; Point_2 min() const; Point_2 max() const; Point_2 vertex(int i) const; Point_2 point(int i) const; Point_2 operator[](int i) const; FT squared_length() const; Direction_2 direction() const; Line_2 supporting_line() const; Self opposite() const; Self transform(const Aff_transformation_2 &t) const; bool is_degenerate() const; Bbox_2 bbox() const; }; CGAL_END_NAMESPACE #ifndef CGAL_CARTESIAN_CLASS_DEFINED #include #endif #endif // CGAL_CARTESIAN_SEGMENT_2_H