File size: 1,306 Bytes
5b89cb9 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 | // This file is part of libigl, a simple c++ geometry processing library.
//
// Copyright (C) 2019 Hanxiao Shen <hanxiao@cs.nyu.edu>
//
// 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 "predicates.h"
namespace igl
{
namespace predicates
{
// Given two segments in 2d test whether they intersect each other
// using predicates 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
// 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
|