point_segment_squared_distance.h 1.2 KB

1234567891011121314151617181920212223242526272829303132333435363738394041
  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_POINT_SEGMENT_SQUARED_DISTANCE_H
  9. #define IGL_COPYLEFT_CGAL_POINT_SEGMENT_SQUARED_DISTANCE_H
  10. #include "../../igl_inline.h"
  11. #include <CGAL/Segment_3.h>
  12. #include <CGAL/Point_3.h>
  13. namespace igl
  14. {
  15. namespace copyleft
  16. {
  17. namespace cgal
  18. {
  19. /// Given a point P1 and segment S2 find the points on each of closest
  20. /// approach and the squared distance thereof.
  21. ///
  22. /// @param[in] P1 point
  23. /// @param[in] S2 segment
  24. /// @param[out] P2 point on S2 closest to P1
  25. /// @param[out] d distance betwee P1 and S2
  26. template < typename Kernel>
  27. IGL_INLINE void point_segment_squared_distance(
  28. const CGAL::Point_3<Kernel> & P1,
  29. const CGAL::Segment_3<Kernel> & S2,
  30. CGAL::Point_3<Kernel> & P2,
  31. typename Kernel::FT & d);
  32. }
  33. }
  34. }
  35. #ifndef IGL_STATIC_LIBRARY
  36. # include "point_segment_squared_distance.cpp"
  37. #endif
  38. #endif