DelaunayFaceList.h

Go to the documentation of this file.

#ifndef included_AMP_DelaunayFaceList
#define included_AMP_DelaunayFaceList
 
#include <array>
#include <cstdint>
#include <stdint.h>
#include <stdlib.h>
#include <vector>
 
#include "AMP/utils/DelaunayHelpers.h"
#include "AMP/utils/extended_int.h"
 
 
namespace AMP::DelaunayTessellation {
 
 
template<int NDIM>
class FaceList
{
public:
    using Point    = std::array<int, NDIM>;
    using Triangle = std::array<int, NDIM + 1>;
 
    FaceList( const int N, const Point *x, const int tri_id, const Triangle &tri );
 
    int get_N_face() { return data.size(); }
 
    void add_node( const int node_id,
                   std::vector<size_t> &unused,
                   size_t &N_tri,
                   std::vector<uint32_t> &new_tri_id,
                   std::vector<Triangle> &new_tri,
                   std::vector<Triangle> &new_tri_nab,
                   std::vector<int> &neighbor,
                   std::vector<int> &face_id );
 
 
 
    void update_face( const int N,
                      const int old_tid[],
                      const int old_fid[],
                      const int new_tid[],
                      const int new_fid[],
                      const Triangle *tri );
 
private:
    static std::array<int64_t, NDIM> calc_surface_normal( const std::array<int, NDIM> x[] );
 
private:
    // Private constructors
    FaceList();                              // Empty constructor.
    FaceList( const FaceList & );            // no implementation for copy
    FaceList &operator=( const FaceList & ); // no implementation for copy
 
    // Structure to store face information
    struct face_data_struct {
        int prev        = -1;
        int next        = -1;
        int tri_id      = -1;        // Triangle id
        int face_id     = -1;        // Face id
        int index[NDIM] = { -1 };    // Indicies of the face vertices
        Point x[NDIM]   = { { 0 } }; // Coordinates of the face vertices
    };
 
    // Data members
    const int Nx;         // The number of vertices
    int hash_table[1024]; // Internal hash table to improve performance when search for a given face
    const Point *x0;      // The vertex coordinates
    double xc[NDIM];      // A point within the centroid
    std::vector<face_data_struct> data; // The stored data
 
    // Function that determines the location of the triangle
    bool outside_triangle( const Point *x, const Point &xi ) const;
 
    // Function to get a unique index for each face
    inline size_t get_face_index( int face, int tri ) { return face + tri * ( NDIM + 1 ); }
 
    // Function to delete a set of faces
    void delete_faces( std::vector<int> &ids );
 
    // Function to check that the internal data is valid
    void check_data();
};
 
} // namespace AMP::DelaunayTessellation
 
#endif