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.
52 lines
1.6 KiB
C++
52 lines
1.6 KiB
C++
// This file is part of libigl, a simple c++ geometry processing library.
|
|
//
|
|
// Copyright (C) 2013 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/.
|
|
#ifndef IGL_ADJACENCY_LIST_H
|
|
#define IGL_ADJACENCY_LIST_H
|
|
#include "igl_inline.h"
|
|
|
|
#include <Eigen/Dense>
|
|
#include <Eigen/Sparse>
|
|
#include <vector>
|
|
namespace igl
|
|
{
|
|
// Constructs the graph adjacency list of a given mesh (V,F)
|
|
// Templates:
|
|
// T should be a eigen sparse matrix primitive type like int or double
|
|
// Inputs:
|
|
// F #F by dim list of mesh faces (must be triangles)
|
|
// sorted flag that indicates if the list should be sorted counter-clockwise
|
|
// Outputs:
|
|
// A vector<vector<T> > containing at row i the adjacent vertices of vertex i
|
|
//
|
|
// Example:
|
|
// // Mesh in (V,F)
|
|
// vector<vector<double> > A;
|
|
// adjacency_list(F,A);
|
|
//
|
|
// See also: edges, cotmatrix, diag
|
|
template <typename Index, typename IndexVector>
|
|
IGL_INLINE void adjacency_list(
|
|
const Eigen::PlainObjectBase<Index> & F,
|
|
std::vector<std::vector<IndexVector> >& A,
|
|
bool sorted = false);
|
|
|
|
// Variant that accepts polygonal faces.
|
|
// Each element of F is a set of indices of a polygonal face.
|
|
template <typename Index>
|
|
IGL_INLINE void adjacency_list(
|
|
const std::vector<std::vector<Index> > & F,
|
|
std::vector<std::vector<Index> >& A);
|
|
|
|
}
|
|
|
|
#ifndef IGL_STATIC_LIBRARY
|
|
# include "adjacency_list.cpp"
|
|
#endif
|
|
|
|
#endif
|