mirror of
https://github.com/SoftFever/OrcaSlicer.git
synced 2025-10-28 11:11:16 -06:00
2ae2672ee9
Fixing dep build script on Windows and removing some warnings. Use bundled igl by default. Not building with the dependency scripts if not explicitly stated. This way, it will stay in Fix the libigl patch to include C source files in header only mode.
107 lines
3.2 KiB
C++
107 lines
3.2 KiB
C++
// 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 "simplify_polyhedron.h"
|
|
#include "decimate.h"
|
|
#include "circulation.h"
|
|
#include "per_face_normals.h"
|
|
#include "infinite_cost_stopping_condition.h"
|
|
#include <functional>
|
|
|
|
IGL_INLINE void igl::simplify_polyhedron(
|
|
const Eigen::MatrixXd & OV,
|
|
const Eigen::MatrixXi & OF,
|
|
Eigen::MatrixXd & V,
|
|
Eigen::MatrixXi & F,
|
|
Eigen::VectorXi & J)
|
|
{
|
|
// TODO: to generalize to open meshes, 0-cost should keep all incident
|
|
// boundary edges on their original lines. (for non-manifold meshes,
|
|
// igl::decimate needs to be generalized)
|
|
|
|
Eigen::MatrixXd N;
|
|
// Function for computing cost of collapsing edge (0 if at least one
|
|
// direction doesn't change pointset, inf otherwise) and placement (in lowest
|
|
// cost direction).
|
|
const auto & perfect= [&N](
|
|
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)
|
|
{
|
|
// Function for ocmputing cost (0 or inf) of collapsing edge by placing
|
|
// vertex at `positive` end of edge.
|
|
const auto & perfect_directed = [&N](
|
|
const int e,
|
|
const bool positive,
|
|
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)
|
|
{
|
|
const auto vi = E(e,positive);
|
|
const auto vj = E(e,!positive);
|
|
p = V.row(vj);
|
|
std::vector<int> faces = igl::circulation(e,positive,F,E,EMAP,EF,EI);
|
|
cost = 0;
|
|
for(auto f : faces)
|
|
{
|
|
// Skip the faces being collapsed
|
|
if(f == EF(e,0) || f == EF(e,1))
|
|
{
|
|
continue;
|
|
}
|
|
const Eigen::RowVectorXd nbefore = N.row(f);
|
|
// Face with vi replaced with vj
|
|
const Eigen::RowVector3i fafter(
|
|
F(f,0) == vi ? vj : F(f,0),
|
|
F(f,1) == vi ? vj : F(f,1),
|
|
F(f,2) == vi ? vj : F(f,2));
|
|
Eigen::RowVectorXd nafter;
|
|
igl::per_face_normals(V,fafter,nafter);
|
|
const double epsilon = 1e-10;
|
|
// if normal changed then not feasible, break
|
|
if((nbefore-nafter).norm() > epsilon)
|
|
{
|
|
cost = std::numeric_limits<double>::infinity();
|
|
break;
|
|
}
|
|
}
|
|
};
|
|
p.resize(3);
|
|
double cost0, cost1;
|
|
Eigen::RowVectorXd p0, p1;
|
|
perfect_directed(e,false,V,F,E,EMAP,EF,EI,cost0,p0);
|
|
perfect_directed(e,true,V,F,E,EMAP,EF,EI,cost1,p1);
|
|
if(cost0 < cost1)
|
|
{
|
|
cost = cost0;
|
|
p = p0;
|
|
}else
|
|
{
|
|
cost = cost1;
|
|
p = p1;
|
|
}
|
|
};
|
|
igl::per_face_normals(OV,OF,N);
|
|
Eigen::VectorXi I;
|
|
igl::decimate(
|
|
OV,OF,
|
|
perfect,
|
|
igl::infinite_cost_stopping_condition(perfect),
|
|
V,F,J,I);
|
|
}
|
|
|