8#ifndef IGL_COPYLEFT_CGAL_SEGMENT_SEGMENT_SQUARED_DISTANCE_H
9#define IGL_COPYLEFT_CGAL_SEGMENT_SEGMENT_SQUARED_DISTANCE_H
10#include "../../igl_inline.h"
11#include <CGAL/Segment_3.h>
12#include <CGAL/Point_3.h>
28 template <
typename Kernel>
30 const CGAL::Segment_3<Kernel> & S1,
31 const CGAL::Segment_3<Kernel> & S2,
32 CGAL::Point_3<Kernel> & P1,
33 CGAL::Point_3<Kernel> & P2,
34 typename Kernel::FT & d);
39#ifndef IGL_STATIC_LIBRARY
40# include "segment_segment_squared_distance.cpp"
#define IGL_INLINE
Definition igl_inline.h:15
bool segment_segment_squared_distance(const CGAL::Segment_3< Kernel > &S1, const CGAL::Segment_3< Kernel > &S2, CGAL::Point_3< Kernel > &P1, CGAL::Point_3< Kernel > &P2, typename Kernel::FT &d)
Given two segments S1 and S2 find the points on each of closest approach and the squared distance the...