12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152 |
- // This file is part of libigl, a simple c++ geometry processing library.
- //
- // Copyright (C) 2016 Oded Stein <oded.stein@columbia.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_LOOP_H
- #define IGL_LOOP_H
- #include <igl/igl_inline.h>
- #include <Eigen/Core>
- #include <Eigen/Sparse>
- namespace igl
- {
- // LOOP Given the triangle mesh [V, F], where n_verts = V.rows(), computes newV and a sparse matrix S s.t. [newV, newF] is the subdivided mesh where newV = S*V.
- //
- // Inputs:
- // n_verts an integer (number of mesh vertices)
- // F an m by 3 matrix of integers of triangle faces
- // Outputs:
- // S a sparse matrix (will become the subdivision matrix)
- // newF a matrix containing the new faces
- IGL_INLINE void loop(const int n_verts,
- const Eigen::MatrixXi& F,
- Eigen::SparseMatrix<double>& S,
- Eigen::MatrixXi& newF);
-
- // LOOP Given the triangle mesh [V, F], computes number_of_subdivs steps of loop subdivision and outputs the new mesh [newV, newF]
- //
- // Inputs:
- // V an n by 3 matrix of vertices
- // F an m by 3 matrix of integers of triangle faces
- // number_of_subdivs an integer that specifies how many subdivision steps to do
- // Outputs:
- // newV a matrix containing the new vertices
- // newF a matrix containing the new faces
- IGL_INLINE void loop(const Eigen::MatrixXd& V,
- const Eigen::MatrixXi& F,
- Eigen::MatrixXd& newV,
- Eigen::MatrixXi& newF,
- const int number_of_subdivs = 1);
-
- }
- #ifndef IGL_STATIC_LIBRARY
- #include "loop.cpp"
- #endif
- #endif
|