3D-printing/OrcaSlicer
1
0
Fork 0
mirror of https://github.com/SoftFever/OrcaSlicer.git synced 2025-10-23 08:41:11 -06:00
Code Issues Projects Releases Packages Wiki Activity Actions 5

Building igl statically and moving to the dep scripts

Browse source 
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.
This commit is contained in:
tamasmeszaros 2019-06-19 14:52:55 +02:00
parent 89e39e3895
commit 2ae2672ee9
1095 changed files with 181 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

60
src/libigl/igl/dijkstra.h Normal file
View file

@ -0,0 +1,60 @@
// This file is part of libigl, a simple c++ geometry processing library.
//
// Copyright (C) 2015 Olga Diamanti <olga.diam@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/.
#ifndef IGL_DIJKSTRA
#define IGL_DIJKSTRA
#include "igl_inline.h"
#include <Eigen/Core>
#include <vector>
#include <set>
namespace igl {
// Dijstra's algorithm for shortest paths, with multiple targets.
// Adapted from http://rosettacode.org/wiki/Dijkstra%27s_algorithm .
//
// Inputs:
// source index of source vertex
// targets target vector set
// VV #V list of lists of incident vertices (adjacency list), e.g.
// as returned by igl::adjacency_list
//
// Output:
// min_distance #V by 1 list of the minimum distances from source to all vertices
// previous #V by 1 list of the previous visited vertices (for each vertex) - used for backtracking
//
template <typename IndexType, typename DerivedD, typename DerivedP>
IGL_INLINE int dijkstra_compute_paths(const IndexType &source,
const std::set<IndexType> &targets,
const std::vector<std::vector<IndexType> >& VV,
Eigen::PlainObjectBase<DerivedD> &min_distance,
Eigen::PlainObjectBase<DerivedP> &previous);
// Backtracking after Dijstra's algorithm, to find shortest path.
//
// Inputs:
// vertex vertex to which we want the shortest path (from same source as above)
// previous #V by 1 list of the previous visited vertices (for each vertex) - result of Dijkstra's algorithm
//
// Output:
// path #P by 1 list of vertex indices in the shortest path from source to vertex
//
template <typename IndexType, typename DerivedP>
IGL_INLINE void dijkstra_get_shortest_path_to(const IndexType &vertex,
const Eigen::PlainObjectBase<DerivedP> &previous,
std::vector<IndexType> &path);
};
#ifndef IGL_STATIC_LIBRARY
#include "dijkstra.cpp"
#endif
#endif /* defined(IGL_DIJKSTRA) */