shortest_edge_and_midpoint.h 1.7 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546
  1. // This file is part of libigl, a simple c++ geometry processing library.
  2. //
  3. // Copyright (C) 2016 Alec Jacobson <[email protected]>
  4. //
  5. // This Source Code Form is subject to the terms of the Mozilla Public License
  6. // v. 2.0. If a copy of the MPL was not distributed with this file, You can
  7. // obtain one at http://mozilla.org/MPL/2.0/.
  8. #ifndef IGL_SHORTEST_EDGE_AND_MIDPOINT_H
  9. #define IGL_SHORTEST_EDGE_AND_MIDPOINT_H
  10. #include "igl_inline.h"
  11. #include <Eigen/Core>
  12. #include <vector>
  13. namespace igl
  14. {
  15. /// Cost and placement function compatible with igl::decimate. The cost of
  16. /// collapsing an edge is its length (prefer to collapse short edges) and the
  17. /// placement strategy for the new vertex is the midpoint of the collapsed
  18. /// edge.
  19. ///
  20. /// @param[in] e index into E of edge to be considered for collapse
  21. /// @param[in] V #V by dim list of vertex positions
  22. /// @param[in] F #F by 3 list of faces (ignored)
  23. /// @param[in] E #E by 2 list of edge indices into V
  24. /// @param[in] EMAP #F*3 list of half-edges indices into E (ignored)
  25. /// @param[in] EF #E by 2 list of edge-face flaps into F (ignored)
  26. /// @param[in] EI #E by 2 list of edge-face opposite corners (ignored)
  27. /// @param[out] cost set to edge length
  28. /// @param[out] p placed point set to edge midpoint
  29. IGL_INLINE void shortest_edge_and_midpoint(
  30. const int e,
  31. const Eigen::MatrixXd & V,
  32. const Eigen::MatrixXi & /*F*/,
  33. const Eigen::MatrixXi & E,
  34. const Eigen::VectorXi & /*EMAP*/,
  35. const Eigen::MatrixXi & /*EF*/,
  36. const Eigen::MatrixXi & /*EI*/,
  37. double & cost,
  38. Eigen::RowVectorXd & p);
  39. }
  40. #ifndef IGL_STATIC_LIBRARY
  41. # include "shortest_edge_and_midpoint.cpp"
  42. #endif
  43. #endif