Alec JacobsonandAlec Jacobson
112c1b8e48
* working insertion and rotation b-b-b-but pointers aren't stuck to m_primitive * insert now maintains primitive's pointers;+rotate is now getting heights in right ballpark * sibling rotations working (and helping); dry run test working (and helping) * working insertion, deletion (detach), and refit with padding. * working; inexact * working; inexact * working; inexact * note about poor assumptions * working well after bug fixes. before refactor into functions * simple self-intersection test function * moved all functions to files * docs * blocking directly in qslim. better docs. aabb templates/tests; * dont use size_t and fix namespace * brute-force too fast on linux * rm overloads in qslim/decimate; cgal template * fix coplanar bug; factor out raytri.c * fix and cgal debug * refactor fast_find; fix bugs in fast_find; fix bugs in shared_vertex * tutorials running again * cleaned up aabb tutorials; templates * format docs * docs. arg names * template name * improve docs * debugging test * debugging test * debugging test * debugging test * debugging test * debugging test * debugging test * debugging test * ebuggin test * ebuggin test * add epsilon to ray_triangle ifs * erroneous includes * rm leftover includes * fix cmake bug * uh actually fix cmake bug * missing delete * simple insert test * don't pad all leaves F.rows() times * fix pad bug --------- Co-authored-by: Alec Jacobson <alecjacobson@adobe.com>
45 lines
1.5 KiB
C++
45 lines
1.5 KiB
C++
#ifndef IGL_TRIANGLE_TRIANGLE_INTERSECT_SHARED_EDGE_H
|
|
#define IGL_TRIANGLE_TRIANGLE_INTERSECT_SHARED_EDGE_H
|
|
|
|
#include "igl_inline.h"
|
|
#include <Eigen/Core>
|
|
|
|
namespace igl
|
|
{
|
|
/// Determine whether two triangles --- which share an edge--- intersect. We
|
|
/// consider the `f`th and `g`th triangles in `F` indexing rows of `V` for 3D
|
|
/// positions, but the `c`th corner (opposite the shared edge) of the `f`th
|
|
/// triangle is replaced by `p`.
|
|
///
|
|
/// @param[in] V #V by 3 list of vertex positions
|
|
/// @param[in] F #F by 3 list of triangle indices into rows of V
|
|
/// @param[in] f index into F of first triangle
|
|
/// @param[in] c index into F of corner opposite shared edge
|
|
/// @param[in] p 3D position to replace cth corner of first triangle
|
|
/// @param[in] g index into F of second triangle
|
|
/// @param[in] epsilon tolerance used to determine coplanarity
|
|
/// @returns true if triangles intersect
|
|
///
|
|
/// \see edge_flaps, tri_tri_intersect, triangle_triangle_intersect
|
|
///
|
|
/// \pre both faces are assumed to have non-trivial area
|
|
template <
|
|
typename DerivedV,
|
|
typename DerivedF,
|
|
typename Derivedp>
|
|
IGL_INLINE bool triangle_triangle_intersect_shared_edge(
|
|
const Eigen::MatrixBase<DerivedV> & V,
|
|
const Eigen::MatrixBase<DerivedF> & F,
|
|
const int f,
|
|
const int c,
|
|
const Eigen::MatrixBase<Derivedp> & p,
|
|
const int g,
|
|
const typename DerivedV::Scalar epsilon);
|
|
}
|
|
|
|
#ifndef IGL_STATIC_LIBRARY
|
|
# include "triangle_triangle_intersect_shared_edge.cpp"
|
|
#endif
|
|
|
|
#endif
|