mrumel/OrcaSlicer-bambulab
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions 3

Initial release
Some checks failed
My Build All / build_windows (push) Has been cancelled
Details
My Build All / build_linux_portable (push) Has been cancelled
Details
My Build All / build_linux_appimage (push) Has been cancelled
Details
My Build All / build_macos (push) Has been cancelled
Details
My Build All / Publish release assets (push) Has been cancelled
Details
Shellcheck / Shellcheck (push) Has been cancelled
Details

Browse source
This commit is contained in:
Louis Rossmann 2026-05-11 07:39:33 -05:00
commit c661ddc2eb
16967 changed files with 4075897 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

23
deps_src/libigl/igl/shortest_edge_and_midpoint.cpp Normal file
View file

@ -0,0 +1,23 @@
// This file is part of libigl, a simple c++ geometry processing library.
//
// Copyright (C) 2016 Alec Jacobson <alecjacobson@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/.
#include "shortest_edge_and_midpoint.h"
IGL_INLINE void igl::shortest_edge_and_midpoint(
const int e,
const Eigen::MatrixXd & V,
const Eigen::MatrixXi & /*F*/,
const Eigen::MatrixXi & E,
const Eigen::VectorXi & /*EMAP*/,
const Eigen::MatrixXi & /*EF*/,
const Eigen::MatrixXi & /*EI*/,
double & cost,
Eigen::RowVectorXd & p)
{
cost = (V.row(E(e,0))-V.row(E(e,1))).norm();
p = 0.5*(V.row(E(e,0))+V.row(E(e,1)));
}