| 123456789101112131415161718192021222324252627282930313233343536 |
- // This file is part of libigl, a simple c++ geometry processing library.
- //
- // Copyright (C) 2014 Alec Jacobson <[email protected]>
- //
- // 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_PARTITION_H
- #define IGL_PARTITION_H
- #include "igl_inline.h"
- #include <Eigen/Dense>
- namespace igl
- {
- /// Partition vertices into groups based on each vertex's vector: vertices
- /// with similar coordinates (close in space) will be put in the same group.
- ///
- /// @param[in] W #W by dim coordinate matrix
- /// @param[in] k desired number of groups default is dim
- /// @param[out] G #W list of group indices (1 to k) for each vertex, such that vertex i
- /// is assigned to group G(i)
- /// @param[out] S k list of seed vertices
- /// @param[out] D #W list of squared distances for each vertex to it's corresponding
- /// closest seed
- IGL_INLINE void partition(
- const Eigen::MatrixXd & W,
- const int k,
- Eigen::Matrix<int,Eigen::Dynamic,1> & G,
- Eigen::Matrix<int,Eigen::Dynamic,1> & S,
- Eigen::Matrix<double,Eigen::Dynamic,1> & D);
- }
- #ifndef IGL_STATIC_LIBRARY
- #include "partition.cpp"
- #endif
- #endif
|