libigl
v2.5.0
Loading...
Searching...
No Matches
path_to_edges.h
Go to the documentation of this file.
1
// This file is part of libigl, a simple c++ geometry processing library.
2
//
3
// Copyright (C) 2019 Lawson Fulton lawsonfulton@gmail.com
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_PATH_TO_EDGES_H
9
#define IGL_PATH_TO_EDGES_H
10
11
#include "
igl_inline.h
"
12
13
#include <Eigen/Core>
14
15
#include <vector>
16
17
namespace
igl
18
{
27
template
<
typename
DerivedI,
typename
DerivedE>
28
IGL_INLINE
void
path_to_edges
(
29
const
Eigen::MatrixBase<DerivedI> & I,
30
Eigen::PlainObjectBase<DerivedE> & E,
31
bool
make_loop=
false
);
33
template
<
typename
Index,
typename
DerivedE>
34
IGL_INLINE
void
path_to_edges
(
35
const
std::vector<Index> & I,
36
Eigen::PlainObjectBase<DerivedE> & E,
37
bool
make_loop=
false
);
38
}
39
#ifndef IGL_STATIC_LIBRARY
40
# include "path_to_edges.cpp"
41
#endif
42
#endif
igl_inline.h
IGL_INLINE
#define IGL_INLINE
Definition
igl_inline.h:15
igl
Definition
AABB.h:17
igl::path_to_edges
void path_to_edges(const Eigen::MatrixBase< DerivedI > &I, Eigen::PlainObjectBase< DerivedE > &E, bool make_loop=false)
Given a path as an ordered list of N>=2 vertex indices I[0], I[1], ..., I[N-1] construct a list of ed...
include
igl
path_to_edges.h
Generated by
1.9.8