| 12345678910111213141516171819202122232425262728293031323334353637383940414243444546 |
- // This file is part of libigl, a simple c++ geometry processing library.
- //
- // Copyright (C) 2019 Hanxiao Shen <[email protected]>
- //
- // 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_PREDICATES_SEGMENT_SEGMENT_INTERSECT_H
- #define IGL_PREDICATES_SEGMENT_SEGMENT_INTERSECT_H
- #include <igl/igl_inline.h>
- #include <Eigen/Core>
- #include <igl/predicates/predicates.h>
- namespace igl
- {
- namespace predicates
- {
-
- // Given two segments in 2d test whether they intersect each other
- // using orient2D
- //
- // Inputs:
- // A: 1st endpoint of segment 1
- // B: 2st endpoint of segment 1
- // C: 1st endpoint of segment 2
- // D: 2st endpoint of segment 2
- // eps: precision used for colinear case
- // Returns true if they intersect
-
- template <typename DerivedP>
- IGL_INLINE bool segment_segment_intersect(
- // input:
- const Eigen::MatrixBase<DerivedP>& A,
- const Eigen::MatrixBase<DerivedP>& B,
- const Eigen::MatrixBase<DerivedP>& C,
- const Eigen::MatrixBase<DerivedP>& D
- );
- }
- }
- #ifndef IGL_STATIC_LIBRARY
- # include "segment_segment_intersect.cpp"
- #endif
- #endif //IGL_PREDICATES_SEGMENT_SEGMENT_INTERSECT_H
|