triangle_triangle_squared_distance.h 1.4 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243
  1. // This file is part of libigl, a simple c++ geometry processing library.
  2. //
  3. // Copyright (C) 2016 Alec Jacobson <[email protected]>
  4. //
  5. // This Source Code Form is subject to the terms of the Mozilla Public License
  6. // v. 2.0. If a copy of the MPL was not distributed with this file, You can
  7. // obtain one at http://mozilla.org/MPL/2.0/.
  8. #ifndef IGL_COPYLEFT_CGAL_TRIANGLE_TRIANGLE_SQUARED_DISTANCE_H
  9. #define IGL_COPYLEFT_CGAL_TRIANGLE_TRIANGLE_SQUARED_DISTANCE_H
  10. #include "../../igl_inline.h"
  11. #include <CGAL/Triangle_3.h>
  12. #include <CGAL/Point_3.h>
  13. namespace igl
  14. {
  15. namespace copyleft
  16. {
  17. namespace cgal
  18. {
  19. /// Given two triangles T1 and T2 find the points on each of closest
  20. /// approach and the squared distance thereof.
  21. ///
  22. /// @param[in] T1 first triangle
  23. /// @param[in] T2 second triangle
  24. /// @param[out] P1 point on T1 closest to T2
  25. /// @param[out] P2 point on T2 closest to T1
  26. /// @param[out] d distance betwee P1 and T2
  27. /// @return true if the closest approach is unique.
  28. template < typename Kernel>
  29. IGL_INLINE bool triangle_triangle_squared_distance(
  30. const CGAL::Triangle_3<Kernel> & T1,
  31. const CGAL::Triangle_3<Kernel> & T2,
  32. CGAL::Point_3<Kernel> & P1,
  33. CGAL::Point_3<Kernel> & P2,
  34. typename Kernel::FT & d);
  35. }
  36. }
  37. }
  38. #ifndef IGL_STATIC_LIBRARY
  39. # include "triangle_triangle_squared_distance.cpp"
  40. #endif
  41. #endif