You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
39 lines
1.0 KiB
39 lines
1.0 KiB
// 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_POINT_INSIDE_CONVEX_POLYGON_H
|
|
#define IGL_PREDICATES_POINT_INSIDE_CONVEX_POLYGON_H
|
|
|
|
|
|
|
|
#include "../igl_inline.h"
|
|
#include <Eigen/Core>
|
|
#include "predicates.h"
|
|
|
|
namespace igl
|
|
{
|
|
namespace predicates
|
|
{
|
|
// check whether 2d point lies inside 2d convex polygon
|
|
// Inputs:
|
|
// P: n*2 polygon, n >= 3
|
|
// q: 2d query point
|
|
// Returns true if point is inside polygon
|
|
template <typename DerivedP, typename DerivedQ>
|
|
IGL_INLINE bool point_inside_convex_polygon(
|
|
const Eigen::MatrixBase<DerivedP>& P,
|
|
const Eigen::MatrixBase<DerivedQ>& q
|
|
);
|
|
}
|
|
}
|
|
|
|
#ifndef IGL_STATIC_LIBRARY
|
|
# include "point_inside_convex_polygon.cpp"
|
|
#endif
|
|
|
|
#endif
|
|
|