// This file is part of libigl, a simple c++ geometry processing library. // // Copyright (C) 2016 Alec Jacobson // // This Source Code Form is subject to the terms of the Mozilla Public License // v. 2.0. If a copy of the MPL was not distributed with this file, You can // obtain one at http://mozilla.org/MPL/2.0/. #ifndef IGL_COPYLEFT_CGAL_SEGMENT_SEGMENT_SQUARED_DISTANCE_H #define IGL_COPYLEFT_CGAL_SEGMENT_SEGMENT_SQUARED_DISTANCE_H #include "../../igl_inline.h" #include #include namespace igl { namespace copyleft { namespace cgal { // Given two segments S1 and S2 find the points on each of closest // approach and the squared distance thereof. // // Inputs: // S1 first segment // S2 second segment // Outputs: // P1 point on S1 closest to S2 // P2 point on S2 closest to S1 // d distance betwee P1 and S2 // Returns true if the closest approach is unique. template < typename Kernel> IGL_INLINE bool segment_segment_squared_distance( const CGAL::Segment_3 & S1, const CGAL::Segment_3 & S2, CGAL::Point_3 & P1, CGAL::Point_3 & P2, typename Kernel::FT & d ); } } } #ifndef IGL_STATIC_LIBRARY # include "segment_segment_squared_distance.cpp" #endif #endif