// This file is part of libigl, a simple c++ geometry processing library. // // Copyright (C) 2018 Alec Jacobson // // 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_IS_DELAUNAY_H #define IGL_IS_DELAUNAY_H #include "igl_inline.h" #include #include namespace igl { // IS_DELAUNAY Determine if each edge in the mesh (V,F) is Delaunay. // // Inputs: // V #V by dim list of vertex positions // F #F by 3 list of triangles indices // Outputs: // D #F by 3 list of bools revealing whether edges corresponding 23 31 12 // are locally Delaunay. Boundary edges are by definition Delaunay. // Non-Manifold edges are by definition not Delaunay. template < typename DerivedV, typename DerivedF, typename DerivedD> IGL_INLINE void is_delaunay( const Eigen::MatrixBase & V, const Eigen::MatrixBase & F, Eigen::PlainObjectBase & D); // Determine whether a single edge is Delaunay using a provided (extrinsic) incirle // test. // // Inputs: // V #V by dim list of vertex positions // F #F by 3 list of triangles indices // uE2E #uE list of lists of indices into E of coexisting edges (see // unique_edge_map) // incircle A functor such that incircle(pa, pb, pc, pd) returns // 1 if pd is on the positive size of circumcirle of (pa,pb,pc) // -1 if pd is on the positive size of circumcirle of (pa,pb,pc) // 0 if pd is cocircular with pa, pb, pc. // (see delaunay_triangulation) // uei index into uE2E of edge to check // Returns true iff edge is Delaunay template < typename DerivedV, typename DerivedF, typename uE2EType, typename InCircle, typename ueiType> IGL_INLINE bool is_delaunay( const Eigen::MatrixBase & V, const Eigen::MatrixBase & F, const std::vector > & uE2E, const InCircle incircle, const ueiType uei); } #ifndef IGL_STATIC_LIBRARY #include "is_delaunay.cpp" #endif #endif