| 123456789101112131415161718192021222324252627282930313233343536 |
- // This file is part of libigl, a simple c++ geometry processing library.
- //
- // Copyright (C) 2013 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_ALL_PAIRS_DISTANCES_H
- #define IGL_ALL_PAIRS_DISTANCES_H
- #include "igl_inline.h"
- namespace igl
- {
- /// Compute distances between each point i in V and point j in U
- ///
- /// D = all_pairs_distances(V,U)
- ///
- /// @tparam matrix class like MatrixXd
- /// @param[in] V #V by dim list of points
- /// @param[in] U #U by dim list of points
- /// @param[in] squared whether to return squared distances
- /// @param[out] D #V by #U matrix of distances, where D(i,j) gives the distance or
- /// squareed distance between V(i,:) and U(j,:)
- template <typename Mat>
- IGL_INLINE void all_pairs_distances(
- const Mat & V,
- const Mat & U,
- const bool squared,
- Mat & D);
- }
- #ifndef IGL_STATIC_LIBRARY
- # include "all_pairs_distances.cpp"
- #endif
- #endif
|