// ============================================================================ // // 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 : $CGAL_Revision: $ // release_date : $CGAL_Date: $ // // file : include/CGAL/intersection_3_1.h // source : web/intersection_3.fw // author(s) : Geert-Jan Giezeman // // coordinator : Saarbruecken // // ============================================================================ #ifndef CGAL_INTERSECTION_3_1_H #define CGAL_INTERSECTION_3_1_H #include #include CGAL_BEGIN_NAMESPACE template Object intersection(const Plane_3 &plane1, const Plane_3&plane2); template inline bool do_intersect(const Plane_3 &plane1, const Plane_3&plane2) { return ! intersection(plane1, plane2).is_empty(); } CGAL_END_NAMESPACE CGAL_BEGIN_NAMESPACE template Object intersection(const Plane_3 &plane, const Line_3&line); template inline Object intersection(const Line_3&line, const Plane_3 &plane) { return intersection(plane,line); } template bool do_intersect(const Plane_3 &p2, const Line_3 &p1); template inline bool do_intersect( const Line_3 &p1, const Plane_3 &p2) { return do_intersect(p2,p1); } CGAL_END_NAMESPACE CGAL_BEGIN_NAMESPACE template Object intersection(const Plane_3 &plane, const Ray_3&ray); template inline Object intersection(const Ray_3&ray, const Plane_3 &plane) { return intersection(plane,ray); } template bool do_intersect(const Plane_3 &p1, const Ray_3 &p2); template inline bool do_intersect( const Ray_3 &p1, const Plane_3 &p2) { return do_intersect(p2,p1); } CGAL_END_NAMESPACE CGAL_BEGIN_NAMESPACE template Object intersection(const Plane_3 &plane, const Segment_3&seg); template inline Object intersection(const Segment_3&seg, const Plane_3 &plane) { return intersection(plane,seg); } template bool do_intersect(const Plane_3 &p1, const Segment_3 &p2); template inline bool do_intersect( const Segment_3 &p1, const Plane_3 &p2) { return do_intersect(p2,p1); } CGAL_END_NAMESPACE CGAL_BEGIN_NAMESPACE template Object intersection(const Line_3 &line, const Bbox_3 &box) ; template inline Object intersection(const Bbox_3 &box, const Line_3 &line) { return intersection(line, box); } CGAL_END_NAMESPACE CGAL_BEGIN_NAMESPACE template Object intersection(const Ray_3 &ray, const Bbox_3 &box) ; template inline Object intersection(const Bbox_3 &box, const Ray_3 &ray) { return intersection(ray, box); } CGAL_END_NAMESPACE CGAL_BEGIN_NAMESPACE template Object intersection(const Segment_3 &seg, const Bbox_3 &box) ; template inline Object intersection(const Bbox_3 &box, const Segment_3 &seg) { return intersection(seg, box); } CGAL_END_NAMESPACE CGAL_BEGIN_NAMESPACE template Object intersection(const Line_3 &line, const Iso_cuboid_3 &box) ; template inline Object intersection(const Iso_cuboid_3 &box, const Line_3 &line) { return intersection(line, box); } CGAL_END_NAMESPACE CGAL_BEGIN_NAMESPACE template Object intersection(const Ray_3 &ray, const Iso_cuboid_3 &box) ; template inline Object intersection(const Iso_cuboid_3 &box, const Ray_3 &ray) { return intersection(ray, box); } CGAL_END_NAMESPACE CGAL_BEGIN_NAMESPACE template Object intersection(const Segment_3 &seg, const Iso_cuboid_3 &box) ; template inline Object intersection(const Iso_cuboid_3 &box, const Segment_3 &seg) { return intersection(seg, box); } CGAL_END_NAMESPACE CGAL_BEGIN_NAMESPACE template Object intersection(const Iso_cuboid_3 &box1, const Iso_cuboid_3 &box2) ; CGAL_END_NAMESPACE #ifdef CGAL_CFG_NO_AUTOMATIC_TEMPLATE_INCLUSION #include #endif #endif // CGAL_INTERSECTION_3_1_H