// This file is part of libigl, a simple c++ geometry processing library. // // Copyright (C) 2015 Qingnan Zhou // // 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 POINTS_INSIDE_COMPONENTS #define POINTS_INSIDE_COMPONENTS #include "../igl_inline.h" #include #include namespace igl { namespace cgal { // Determine if queries points P are inside of connected facet component // (V, F, I), where I indicates a subset of facets that forms the // component. // // Precondition: // The input mesh must be a closed, self-intersection free, // non-degenerated surface. Queries points must be either inside or // outside of the mesh (i.e. not on the surface of the mesh). // // Inputs: // V #V by 3 array of vertex positions. // F #F by 3 array of triangles. // I #I list of triangle indices to consider. // P #P by 3 array of query points. // // Outputs: // inside #P list of booleans that is true iff the corresponding // query point is inside of the mesh. template IGL_INLINE void points_inside_component( const Eigen::PlainObjectBase& V, const Eigen::PlainObjectBase& F, const Eigen::PlainObjectBase& I, const Eigen::PlainObjectBase& P, Eigen::PlainObjectBase& inside); // Determine if query points P is inside of the mesh (V, F). // See above for precondition and I/O specs. template IGL_INLINE void points_inside_component( const Eigen::PlainObjectBase& V, const Eigen::PlainObjectBase& F, const Eigen::PlainObjectBase& P, Eigen::PlainObjectBase& inside); } } #ifndef IGL_STATIC_LIBRARY #include "points_inside_component.cpp" #endif #endif