// Copyright (c) 1997-2021
// Utrecht University (The Netherlands),
// ETH Zurich (Switzerland),
// INRIA Sophia-Antipolis (France),
// Max-Planck-Institute Saarbruecken (Germany),
// and Tel-Aviv University (Israel).
// GeometryFactory (France)
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org)
//
// $URL: https://github.com/CGAL/cgal/blob/v6.1/Intersections_3/include/CGAL/Intersections_3/Bbox_3_Tetrahedron_3.h $
// $Id: include/CGAL/Intersections_3/Bbox_3_Tetrahedron_3.h b26b07a1242 $
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
//
// Author(s)     : Sebastien Loriot
//

#ifndef CGAL_INTERSECTIONS_3_BBOX_3_TETRAHEDRON_3_H
#define CGAL_INTERSECTIONS_3_BBOX_3_TETRAHEDRON_3_H

#include <CGAL/Intersections_3/internal/Bbox_3_Tetrahedron_3_do_intersect.h>

#include <CGAL/Bbox_3.h>
#include <CGAL/Tetrahedron_3.h>

namespace CGAL {

template<typename K>
typename K::Boolean
do_intersect(const CGAL::Bbox_3& box,
             const Tetrahedron_3<K>& t)
{
  return K().do_intersect_3_object()(box, t);
}

template<typename K>
typename K::Boolean
do_intersect(const Tetrahedron_3<K>& t,
             const CGAL::Bbox_3& box)
{
  return K().do_intersect_3_object()(t, box);
}

} // namespace CGAL

#endif // CGAL_INTERSECTIONS_3_BBOX_3_TETRAHEDRON_3_H

