// ====================================================================== // // Copyright (c) 1997 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 : 1999, October 01 // // file : include/CGAL/bops_Triangle_2.h // package : bops (2.2) // source : include/CGAL/bops_Triangle_2.h // revision : $Revision$ // revision_date : $Date$ // author(s) : Wolfgang Freiseisen // // coordinator : RISC Linz // (Wolfgang Freiseisen ) // // // ====================================================================== #ifndef CGAL_BOPS_TRIANGLE2_H #define CGAL_BOPS_TRIANGLE2_H #include #include CGAL_BEGIN_NAMESPACE /* NOT IMPLEMENTED YET #include bool do_intersect( const Triangle_2& A, const Triangle_2& B); OutputIterator intersection( const Triangle_2& A, const Triangle_2& B, OutputIterator object_it); { CGAL_bops_precondition_msg( !A.is_degenerate(), "Triangle_2 A is degenerated"); CGAL_bops_precondition_msg( !B.is_degenerate(), "Triangle_2 B is degenerated"); *object_it++= intersection(A,B); return object_it; } */ template < class R, class OutputIterator > OutputIterator Union( const Triangle_2& A, const Triangle_2& B, OutputIterator object_it); template < class R, class OutputIterator > OutputIterator difference( const Triangle_2& A, const Triangle_2& B, OutputIterator list_of_objects_it); CGAL_END_NAMESPACE #ifdef CGAL_CFG_NO_AUTOMATIC_TEMPLATE_INCLUSION #include #endif #endif // CGAL_BOPS_TRIANGLE2_H