123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566 |
- // This file is part of libigl, a simple c++ geometry processing library.
- //
- // Copyright (C) 2014 Stefan Brugger <stefanbrugger@gmail.com>
- //
- // 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_BOUNDARY_LOOP_H
- #define IGL_BOUNDARY_LOOP_H
- #include "igl_inline.h"
- #include <Eigen/Dense>
- #include <vector>
- namespace igl
- {
- // Compute list of ordered boundary loops for a manifold mesh.
- //
- // Templates:
- // Index index type
- // Inputs:
- // F #V by dim list of mesh faces
- // Outputs:
- // L list of loops where L[i] = ordered list of boundary vertices in loop i
- //
- template <typename DerivedF, typename Index>
- IGL_INLINE void boundary_loop(
- const Eigen::PlainObjectBase<DerivedF>& F,
- std::vector<std::vector<Index> >& L);
- // Compute ordered boundary loops for a manifold mesh and return the
- // longest loop in terms of vertices.
- //
- // Templates:
- // Index index type
- // Inputs:
- // F #V by dim list of mesh faces
- // Outputs:
- // L ordered list of boundary vertices of longest boundary loop
- //
- template <typename DerivedF, typename Index>
- IGL_INLINE void boundary_loop(
- const Eigen::PlainObjectBase<DerivedF>& F,
- std::vector<Index>& L);
- // Compute ordered boundary loops for a manifold mesh and return the
- // longest loop in terms of vertices.
- //
- // Templates:
- // Index index type
- // Inputs:
- // F #V by dim list of mesh faces
- // Outputs:
- // L ordered list of boundary vertices of longest boundary loop
- //
- template <typename DerivedF, typename DerivedL>
- IGL_INLINE void boundary_loop(
- const Eigen::PlainObjectBase<DerivedF>& F,
- Eigen::PlainObjectBase<DerivedL>& L);
- }
- #ifndef IGL_STATIC_LIBRARY
- # include "boundary_loop.cpp"
- #endif
- #endif
|